{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T07:15:35Z","timestamp":1782544535810,"version":"3.54.5"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,8]]},"abstract":"<jats:p>\n            SpatialHadoop is an extended MapReduce framework that supports\n            <jats:italic>global indexing<\/jats:italic>\n            that spatial partitions the data across machines providing orders of magnitude speedup, compared to traditional Hadoop. In this paper, we describe seven alternative partitioning techniques and experimentally study their effect on the quality of the generated index and the performance of range and spatial join queries. We found that using a 1% sample is enough to produce high quality partitions. Also, we found that the total area of partitions is a reasonable measure of the quality of indexes when running spatial join. This study will assist researchers in choosing a good spatial partitioning technique in distributed environments.\n          <\/jats:p>","DOI":"10.14778\/2824032.2824057","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T12:18:17Z","timestamp":1442405897000},"page":"1602-1605","source":"Crossref","is-referenced-by-count":92,"title":["Spatial partitioning techniques in SpatialHadoop"],"prefix":"10.14778","volume":"8","author":[{"given":"Ahmed","family":"Eldawy","sequence":"first","affiliation":[{"name":"University of Minnesota"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louai","family":"Alarabi","sequence":"additional","affiliation":[{"name":"University of Minnesota"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed F.","family":"Mokbel","sequence":"additional","affiliation":[{"name":"University of Minnesota"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536274.2536283"},{"key":"e_1_2_1_3_1","volume-title":"ICDE","author":"Eldawy A.","year":"2015","unstructured":"A. Eldawy and M. F. Mokbel . SpatialHadoop: A MapReduce Framework for Spatial Data . In ICDE , 2015 . A. Eldawy and M. F. Mokbel. SpatialHadoop: A MapReduce Framework for Spatial Data. In ICDE, 2015."},{"key":"e_1_2_1_4_1","first-page":"322","volume-title":"SIGMOD","author":"N.","year":"1990","unstructured":"N. B. et al. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles . In SIGMOD , pages 322 -- 331 , 1990 . 10.1145\/93605.98741 N. B. et al. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD, pages 322--331, 1990. 10.1145\/93605.98741"},{"key":"e_1_2_1_5_1","first-page":"701","volume-title":"SIGMOD","author":"S.","year":"2013","unstructured":"S. N. et al. Touch: In-memory Spatial Join by Hierarchical Data-oriented Partitioning . In SIGMOD , pages 701 -- 712 , 2013 . 10.1145\/2463676.2463700 S. N. et al. Touch: In-memory Spatial Join by Hierarchical Data-oriented Partitioning. In SIGMOD, pages 701--712, 2013. 10.1145\/2463676.2463700"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"e_1_2_1_7_1","first-page":"156","volume-title":"VLDB","author":"Hoel E. G.","year":"1994","unstructured":"E. G. Hoel and H. Samet . Performance of Data-Parallel Spatial Operations . In VLDB , pages 156 -- 167 , 1994 . E. G. Hoel and H. Samet. Performance of Data-Parallel Spatial Operations. In VLDB, pages 156--167, 1994."},{"key":"e_1_2_1_8_1","first-page":"497","volume-title":"ICDE","author":"Leutenegger S.","year":"1997","unstructured":"S. Leutenegger , M. Lopez , and J. Edgington . STR: A Simple and Efficient Algorithm for R-Tree Packing . In ICDE , pages 497 -- 506 , 1997 . S. Leutenegger, M. Lopez, and J. Edgington. STR: A Simple and Efficient Algorithm for R-Tree Packing. In ICDE, pages 497--506, 1997."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2824032.2824057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:14:21Z","timestamp":1672222461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2824032.2824057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.14778\/2824032.2824057"],"URL":"https:\/\/doi.org\/10.14778\/2824032.2824057","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}