Title of article :
An Efficient Partitioning Technique in SpatialHadoop
Author/Authors :
elashry, ahmed kafr el-sheikh university - faculty of computers and information - information system department, Egypt , shehab, abdulaziz mansoura university - faculty of computers and information - information technology department, Egypt , riad, alaa. m. mansoura university - faculty of computers and information - information system department, Egypt , aboul-fotouh, ahmed mansoura university - faculty of computers and information - information technology department, Egypt
From page :
1
To page :
13
Abstract :
SpatialHadoop is a Hadoop framework supporting spatial information handling in light of MapReduce programming worldview. A huge number of studies leads to that SpatialHadoop outperforms the traditional Hadoop in both overseeing and handling spatial data operations. Indexing at SpatialHadoop makes it better than Hadoop. However, the design of a proficient and powerful indexing technique is stay as a major challenge. This paper presents a novel partitioning technique in SpatialHadoop. It has a better performance compared to other partitioning techniques. The proposed technique performance has been studied in several cases utilizing a real datasets on a spatial range and k- Nearest-Neighbour (kNN) queries. The experimental results have demonstrated the efficiency of the proposed technique.
Keywords :
Spatial Data indexing , Spatial partitioning , Cloud computing , SpatialHadoop , PR , Tree
Journal title :
International Journal of Intelligent Computing and Information Sciences
Journal title :
International Journal of Intelligent Computing and Information Sciences
Record number :
2747987
Link To Document :
بازگشت