An Efficient Partitioning Technique in SpatialHadoop | ||||
| International Journal of Intelligent Computing and Information Sciences | ||||
| Article 1, Volume 18, Issue 1, January 2018, Page 1-13 PDF (929.04 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/ijicis.2018.15893 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Ahmed Ahmed_Elashry@fci.kfs.edu.eg1; abdulaziz Shehab2; Alaa Riad3; Ahmed Aboul-fotouh2 | ||||
| 1Information System Department, Faculty of Computers and Information, Kafr El-Sheikh University, Egypt | ||||
| 2Information Technology Department, Faculty of Computers and Information, Mansoura University, Egypt | ||||
| 3Information System Department, Faculty of Computers and Information, Mansoura University, Egypt | ||||
| 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. | ||||
|
Statistics Article View: 427 PDF Download: 602 |
||||
