An Enhanced Partitioning Approach in SpatialHadoop for Handling Big Spatial Data
Résumé
Abstract SpatialHadoop could handle spatial data operations in a low partitioning execution time compared to the traditional Hadoop. However, developing an efficient and an accurate partitioning algorithm is still a research field opened to many researchers. Confidently, this paper proposes a Minimum Boundary Rectangle-aware Priority R-Tree (MBR-aware PR-Tree) as an enhanced partitioning algorithm applicable at SpatialHadoop. Compared to state-of-art partitioning algorithms, our proposed algorithm outperforms them in terms of query execution time, file size, number of partitions, indexing time, and number of returned objects. The experimental results show superiority of our algorithm which have been confirmed for both spatial range query and k-nearest-neighbour query through evaluating the performance in different scenarios using a real dataset.
Citer ce document
Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)
Accès au document
Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter
Voir l'article sur le site de la revueLicence et provenance
Licence : CC BY
Notice moissonnée depuis OpenAlex le 16/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →