{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:50Z","timestamp":1775638490423,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T00:00:00Z","timestamp":1572912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["720270"],"award-info":[{"award-number":["720270"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["617508"],"award-info":[{"award-number":["617508"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,5]]},"DOI":"10.1145\/3347146.3359077","type":"proceedings-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:08:16Z","timestamp":1573682896000},"page":"139-148","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficient Bundled Spatial Range Queries"],"prefix":"10.1145","author":[{"given":"Eleni Tzirita","family":"Zacharatou","sequence":"first","affiliation":[{"name":"EPFL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darius","family":"\u0160idlauskas","sequence":"additional","affiliation":[{"name":"EPFL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhan","family":"Tauheed","sequence":"additional","affiliation":[{"name":"Oracle Labs Zurich and EPFL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Heinis","sequence":"additional","affiliation":[{"name":"Imperial College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasia","family":"Ailamaki","sequence":"additional","affiliation":[{"name":"EPFL and RAW Labs SA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"V. Akcelik J. Bielak etal 2003. High resolution forward and inverse earthquake modeling on terascale computers. In Supercomputing. 52--52.  V. Akcelik J. Bielak et al. 2003. High resolution forward and inverse earthquake modeling on terascale computers. In Supercomputing. 52--52.","DOI":"10.1145\/1048935.1050202"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4485(89)90125-5"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. SIGMOD. 347--358","author":"Arge L.","unstructured":"L. Arge , M. de Berg , H. J. Haverkort , and K. Yi . 2004. The Priority R-tree: A Practically Efficient and Worst-case Optimal R-tree . In Proc. SIGMOD. 347--358 . L. Arge, M. de Berg, H. J. Haverkort, and K. Yi. 2004. The Priority R-tree: A Practically Efficient and Worst-case Optimal R-tree. In Proc. SIGMOD. 347--358."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. SIGMOD. 322--331","author":"Beckmann N.","unstructured":"N. Beckmann , H.-P. Kriegel , R. Schneider , and B. Seeger . 1990. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles . In Proc. SIGMOD. 322--331 . N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. 1990. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In Proc. SIGMOD. 322--331."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. SIGMOD. 799--812","author":"Beckmann N.","unstructured":"N. Beckmann and B. Seeger . 2009. A Revised R*-tree in Comparison with Related Index Structures . In Proc. SIGMOD. 799--812 . N. Beckmann and B. Seeger. 2009. A Revised R*-tree in Comparison with Related Index Structures. In Proc. SIGMOD. 799--812."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"S. Brakatsoulas D. Pfoser and Y. Theodoridis. 2002. Revisiting R-tree Construction Principles. Technical Report. Revision.  S. Brakatsoulas D. Pfoser and Y. Theodoridis. 2002. Revisiting R-tree Construction Principles. Technical Report. Revision.","DOI":"10.1007\/3-540-45710-0_13"},{"key":"e_1_3_2_1_8_1","volume-title":"Leutenegger","author":"Yv\u00e1n J.","year":"1998","unstructured":"Yv\u00e1n J. Garc\u00eda R., Mario Lopez , and Scott T . Leutenegger . 1998 . A greedy algorithm for bulk loading R-trees. In Proc. GIS. 163--164. Yv\u00e1n J. Garc\u00eda R., Mario Lopez, and Scott T. Leutenegger. 1998. A greedy algorithm for bulk loading R-trees. In Proc. GIS. 163--164."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602266"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(80)90055-6"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. VLDB. 500--509","author":"Kamel I.","unstructured":"I. Kamel and C. Faloutsos . 1994. Hilbert R-tree: An improved R-tree using fractals . In Proc. VLDB. 500--509 . I. Kamel and C. Faloutsos. 1994. Hilbert R-tree: An improved R-tree using fractals. In Proc. VLDB. 500--509."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. SSDBM. 132--150","author":"Kwon YC.","unstructured":"YC. Kwon , D. Nunley , J. P. Gardner , M. Balazinska , B. Howe , and S. Loebman . 2010. Scalable clustering algorithm for N-body simulations in a shared-nothing cluster . In Proc. SSDBM. 132--150 . YC. Kwon, D. Nunley, J. P. Gardner, M. Balazinska, B. Howe, and S. Loebman. 2010. Scalable clustering algorithm for N-body simulations in a shared-nothing cluster. In Proc. SSDBM. 132--150."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. ICDE. 497--506","author":"Leutenegger Scott T.","unstructured":"Scott T. Leutenegger , Mario Lopez , and J. Edgington . 1997. STR: A simple and efficient algorithm for R-tree packing . In Proc. ICDE. 497--506 . Scott T. Leutenegger, Mario Lopez, and J. Edgington. 1997. STR: A simple and efficient algorithm for R-tree packing. In Proc. ICDE. 497--506."},{"key":"e_1_3_2_1_14_1","first-page":"585","article-title":"IR-Tree: An Efficient Index for Geographic Document Search","volume":"23","author":"Li Zhisheng","year":"2011","unstructured":"Zhisheng Li , Ken C. K. Lee , Baihua Zheng , Wang-Chien Lee , Dik Lee , and Xufa Wang . 2011 . IR-Tree: An Efficient Index for Geographic Document Search . IEEE TKDE 23 , 4 (2011), 585 -- 599 . Zhisheng Li, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee, Dik Lee, and Xufa Wang. 2011. IR-Tree: An Efficient Index for Geographic Document Search. IEEE TKDE 23, 4 (2011), 585--599.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2011.12.015"},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. VLDB. 507--518","author":"Sellis T.","unstructured":"T. Sellis , N. Roussopoulos , and C. Faloutsos . 1987. The R+-tree: A dynamic index for multi-dimensional objects . In Proc. VLDB. 507--518 . T. Sellis, N. Roussopoulos, and C. Faloutsos. 1987. The R+-tree: A dynamic index for multi-dimensional objects. In Proc. VLDB. 507--518."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. ICDE. 425--436","author":"\u0160idlauskas D.","unstructured":"D. \u0160idlauskas , S. Chester , E. Tzirita Zacharatou , and A. Ailamaki . 2018. Improving Spatial Data Processing by Clipping Minimum Bounding Boxes . In Proc. ICDE. 425--436 . D. \u0160idlauskas, S. Chester, E. Tzirita Zacharatou, and A. Ailamaki. 2018. Improving Spatial Data Processing by Clipping Minimum Bounding Boxes. In Proc. ICDE. 425--436."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/136588197242185"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. ICDE. 941--952","author":"Tauheed F.","unstructured":"F. Tauheed , L. Biveinis , T. Heinis , F. Sch\u00fcrmann , H. Markram , and A. Ailamaki . 2012. Accelerating Range Queries For Brain Simulations . In Proc. ICDE. 941--952 . F. Tauheed, L. Biveinis, T. Heinis, F. Sch\u00fcrmann, H. Markram, and A. Ailamaki. 2012. Accelerating Range Queries For Brain Simulations. In Proc. ICDE. 941--952."},{"key":"e_1_3_2_1_20_1","unstructured":"T. Ulrich. 2000. Loose Octrees. In Game Programming Gems Mark DeLoura (Ed.). Charles River Media 444--453.  T. Ulrich. 2000. Loose Octrees. In Game Programming Gems Mark DeLoura (Ed.). Charles River Media 444--453."}],"event":{"name":"SIGSPATIAL '19: 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","location":"Chicago IL USA","acronym":"SIGSPATIAL '19","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3347146.3359077","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3347146.3359077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:59Z","timestamp":1750202639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3347146.3359077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,5]]},"references-count":20,"alternative-id":["10.1145\/3347146.3359077","10.1145\/3347146"],"URL":"https:\/\/doi.org\/10.1145\/3347146.3359077","relation":{},"subject":[],"published":{"date-parts":[[2019,11,5]]},"assertion":[{"value":"2019-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}