{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:55:36Z","timestamp":1750308936341,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T00:00:00Z","timestamp":1498521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["617508"],"award-info":[{"award-number":["617508"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011273","name":"FP7 Information and Communication Technologies","doi-asserted-by":"publisher","award":["317858"],"award-info":[{"award-number":["317858"]}],"id":[{"id":"10.13039\/100011273","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["650003"],"award-info":[{"award-number":["650003"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,27]]},"DOI":"10.1145\/3085504.3085519","type":"proceedings-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T12:50:05Z","timestamp":1496667005000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["BLOCK"],"prefix":"10.1145","author":[{"given":"Matthaios","family":"Olma","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}]},{"given":"Farhan","family":"Tauheed","sequence":"additional","affiliation":[{"name":"Oracle Labs, Zurich, Switzerland"}]},{"given":"Thomas","family":"Heinis","sequence":"additional","affiliation":[{"name":"Imperial College, London, United Kingdom"}]},{"given":"Anastasia","family":"Ailamaki","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2017,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298579"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007608"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734714.1734731"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/356789.356797"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376622"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"volume-title":"Leutenegger. A Greedy Algorithm for Bulk Loading R-trees. In GIS '96","author":"Garc\u00eda Yv\u00e1n J.","key":"e_1_3_2_1_9_1","unstructured":"Yv\u00e1n J. Garc\u00eda , Mario A. L\u00f3pez , and Scott T . Leutenegger. A Greedy Algorithm for Bulk Loading R-trees. In GIS '96 . Yv\u00e1n J. Garc\u00eda, Mario A. L\u00f3pez, and Scott T. Leutenegger. A Greedy Algorithm for Bulk Loading R-trees. In GIS '96."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199431"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/320134.320162"},{"volume-title":"Peter Widmayer. The Twin Grid File: A Nearly Space Optimal Index Structure. In EDBT '88","author":"Hutflesz Andreas","key":"e_1_3_2_1_13_1","unstructured":"Andreas Hutflesz , Hans-Werner Six , and Peter Widmayer. The Twin Grid File: A Nearly Space Optimal Index Structure. In EDBT '88 . Andreas Hutflesz, Hans-Werner Six, and Peter Widmayer. The Twin Grid File: A Nearly Space Optimal Index Structure. In EDBT '88."},{"volume-title":"ByungS Lee. Performance Evaluation of Main-Memory R-tree Variants. In SSTD '03","author":"Hwang Sangyong","key":"e_1_3_2_1_14_1","unstructured":"Sangyong Hwang , Keunjoo Kwon , Sang K Cha , and ByungS Lee. Performance Evaluation of Main-Memory R-tree Variants. In SSTD '03 . Sangyong Hwang, Keunjoo Kwon, SangK Cha, and ByungS Lee. Performance Evaluation of Main-Memory R-tree Variants. In SSTD '03."},{"key":"e_1_3_2_1_15_1","volume-title":"Tanimoto","author":"Jackins Chris L.","year":"1980","unstructured":"Chris L. Jackins and Steven L . Tanimoto . 1980 . Oct-trees and Their Use in Representing Three-dimensional Objects. Computer Graphics and Image Processing 14, 3 (1980). Chris L. Jackins and Steven L. Tanimoto. 1980. Oct-trees and Their Use in Representing Three-dimensional Objects. Computer Graphics and Image Processing 14, 3 (1980)."},{"volume-title":"VLDB '94","author":"Kamel Ibrahim","key":"e_1_3_2_1_16_1","unstructured":"Ibrahim Kamel and Christos Faloutsos . Hilbert R- Tree : An Improved R-Tree using Fractals . In VLDB '94 . Ibrahim Kamel and Christos 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\/375663.375679"},{"volume-title":"Koudas and Kenneth Sevcik. Size Separation Join. In SIGMOD '97","author":"Nick","key":"e_1_3_2_1_18_1","unstructured":"Nick Koudas and Kenneth Sevcik. Size Separation Join. In SIGMOD '97 . Nick Koudas and Kenneth Sevcik. Size Separation Join. In SIGMOD '97."},{"volume-title":"ICDE '97","author":"Leutenegger S. T.","key":"e_1_3_2_1_19_1","unstructured":"S. T. Leutenegger , M. A. Lopez , and J. Edgington . STR: a Simple and Efficient Algorithm for R-tree Packing . In ICDE '97 . S. T. Leutenegger, M. A. 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.1038\/nrn1848"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/348.318586"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16886"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199438"},{"volume-title":"SSTD '03","author":"Procopiuc Octavian","key":"e_1_3_2_1_24_1","unstructured":"Octavian Procopiuc , Pankaj K. Agarwal , Lars Arge , and Jeffrey Scott Vitter . Bkd-Tree : A Dynamic Scalable kd-Tree . In SSTD '03 . Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, and Jeffrey Scott Vitter. Bkd-Tree: A Dynamic Scalable kd-Tree. In SSTD '03."},{"volume-title":"VLDB '00","author":"Ramsak Frank","key":"e_1_3_2_1_25_1","unstructured":"Frank Ramsak , Volker Markl , Robert Fenk , Martin Zirkel , and Rudolf Bayer . Integrating the UB-Tree into a Database System Kernel . In VLDB '00 . Frank Ramsak, Volker Markl, Robert Fenk, Martin Zirkel, and Rudolf Bayer. Integrating the UB-Tree into a Database System Kernel. In VLDB '00."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"volume-title":"VLDB '87","author":"Sellis Timos K.","key":"e_1_3_2_1_27_1","unstructured":"Timos K. Sellis , Nick Roussopoulos , and Christos Faloutsos . The R+- Tree : A Dynamic Index for Multi-Dimensional Objects . In VLDB '87 . Timos K. Sellis, Nick Roussopoulos, and Christos Faloutsos. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In VLDB '87."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653805"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.56"},{"key":"e_1_3_2_1_30_1","unstructured":"Thatcher Ulrich. 2000. Loose Octrees. In Game Programming Gems.  Thatcher Ulrich. 2000. Loose Octrees. In Game Programming Gems."}],"event":{"name":"SSDBM '17: 29th International Conference on Scientific and Statistical Database Management","sponsor":["Northwestern University Northwestern University"],"location":"Chicago IL USA","acronym":"SSDBM '17"},"container-title":["Proceedings of the 29th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3085504.3085519","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3085504.3085519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:36:57Z","timestamp":1750282617000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3085504.3085519"}},"subtitle":["Efficient Execution of Spatial Range Queries in Main-Memory"],"short-title":[],"issued":{"date-parts":[[2017,6,27]]},"references-count":30,"alternative-id":["10.1145\/3085504.3085519","10.1145\/3085504"],"URL":"https:\/\/doi.org\/10.1145\/3085504.3085519","relation":{},"subject":[],"published":{"date-parts":[[2017,6,27]]},"assertion":[{"value":"2017-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}