{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:35:02Z","timestamp":1774949702801,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463676.2463700","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"701-712","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["TOUCH"],"prefix":"10.1145","author":[{"given":"Sadegh","family":"Nobari","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhan","family":"Tauheed","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Heinis","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasia","family":"Ailamaki","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"GIS '94","author":"Aref W. G.","unstructured":"W. G. Aref and H. Samet . A Cost Model for Query Optimization Using R-Trees . In GIS '94 . W. G. Aref and H. Samet. A Cost Model for Query Optimization Using R-Trees. In GIS '94."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/258319.258327"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/191246.191307"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007608"},{"key":"e_1_3_2_1_5_1","volume-title":"Scalable Sweeping-Based Spatial Join. In VLDB '98","author":"Arge L.","unstructured":"L. Arge , O. Procopiuc , S. Ramaswamy , T. Suel , and J. S. Vitter . Scalable Sweeping-Based Spatial Join. In VLDB '98 . L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Scalable Sweeping-Based Spatial Join. In VLDB '98."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/93605.98741"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170075"},{"key":"e_1_3_2_1_8_1","volume-title":"Data Redundancy and Duplicate Detection in Spatial Join Processing. In ICDE","author":"Dittrich J.-P.","year":"2000","unstructured":"J.-P. Dittrich and B. Seeger . Data Redundancy and Duplicate Detection in Spatial Join Processing. In ICDE 2000 . J.-P. Dittrich and B. Seeger. Data Redundancy and Duplicate Detection in Spatial Join Processing. In ICDE 2000."},{"key":"e_1_3_2_1_9_1","volume-title":"Fundamentals of Database Systems","author":"Elmasri R.","year":"2000","unstructured":"R. Elmasri and S. B. Navathe . Fundamentals of Database Systems . Addison Wesley , 3 rd edition, 2000 . R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Addison Wesley, 3rd edition, 2000.","edition":"3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4103\/2153-3539.83192"},{"key":"e_1_3_2_1_11_1","volume-title":"GIS '96","author":"Garc\u00eda Y. J.","unstructured":"Y. J. Garc\u00eda , M. A. L\u00f3pez , and S. T. Leutenegger . A Greedy Algorithm for Bulk Loading R-trees . In GIS '96 . Y. J. Garc\u00eda, M. A. L\u00f3pez, and S. T. Leutenegger. A Greedy Algorithm for Bulk Loading R-trees. In GIS '96."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0959-440X(03)00040-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602266"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00656997"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206049.1206056"},{"key":"e_1_3_2_1_16_1","volume-title":"VLDB '94","author":"Kamel I.","unstructured":"I. Kamel and C. Faloutsos . Hilbert R-tree: An Improved R-tree using Fractals . In VLDB '94 . I. Kamel and C. Faloutsos. Hilbert R-tree: An Improved R-tree using Fractals. In VLDB '94."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253340"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1375990.1375995"},{"key":"e_1_3_2_1_19_1","volume-title":"ICDE '97","author":"Leutenegger S.","unstructured":"S. Leutenegger , M. Lopez , and J. Edgington . STR: a Simple and Efficient Algorithm for R-Tree Packing . In ICDE '97 . S. Leutenegger, M. Lopez, and J. Edgington. STR: a Simple and Efficient Algorithm for R-Tree Packing. In ICDE '97."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233337"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191881"},{"key":"e_1_3_2_1_22_1","first-page":"697","volume-title":"ICDE","author":"Luo G.","year":"2002","unstructured":"G. Luo , J. F. Naughton , and C. J. Ellmann . A non-blocking parallel spatial join algorithm . In ICDE , pages 697 -- 705 , 2002 . G. Luo, J. F. Naughton, and C. J. Ellmann. A non-blocking parallel spatial join algorithm. In ICDE, pages 697--705, 2002."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1161591"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/128762.128764"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145842"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98743"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233338"},{"key":"e_1_3_2_1_28_1","volume-title":"Computational Geometry: An Introduction","author":"Preparata F.","year":"1993","unstructured":"F. Preparata and M. Shamos . Computational Geometry: An Introduction . Springer , 1993 . F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer, 1993."},{"key":"e_1_3_2_1_29_1","volume-title":"VLDB '87","author":"Sellis T. K.","unstructured":"T. K. Sellis , N. Roussopoulos , and C. Faloutsos . The R++-Tree: A Dynamic Index for Multi-Dimensional Objects . In VLDB '87 . T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The R++-Tree: A Dynamic Index for Multi-Dimensional Objects. In VLDB '87."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191939"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2463700","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2463700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:01Z","timestamp":1750235941000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2463700"}},"subtitle":["in-memory spatial join by hierarchical data-oriented partitioning"],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":30,"alternative-id":["10.1145\/2463676.2463700","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2463700","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}