{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:26Z","timestamp":1750308086586,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,6]],"date-time":"2005-06-06T00:00:00Z","timestamp":1118016000000},"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":[[2005,6,6]]},"DOI":"10.1145\/1064092.1064120","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"170-179","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Cache-oblivious R-trees"],"prefix":"10.1145","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[{"name":"University of Aarhus, Aarhus N, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[{"name":"TU Eindhoven, MB Eindhoven, the Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herman","family":"Haverkort","sequence":"additional","affiliation":[{"name":"University of Aarhus, Aarhus N, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777828"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684250"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-002-2817-1"},{"key":"e_1_3_2_1_4_1","series-title":"Contemporary Mathematics","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"Agarwal P. K.","year":"1999","unstructured":"P. K. Agarwal and J. Erickson . Geometric range searching and its relatives . In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry , volume 223 of Contemporary Mathematics , pages 1 -- 56 . American Mathematical Society , Providence, RI , 1999 .]] P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1--56. American Mathematical Society, Providence, RI, 1999.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/779232.779242"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509950"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007608"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2003.04.001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684398"},{"key":"e_1_3_2_1_13_1","first-page":"339","volume-title":"Farach-Colton. Cache-oblivious B-trees. In Proc. IEEE Symposium on Foundations of Computer Science","author":"Bender M. A.","year":"2000","unstructured":"M. A. Bender , E. D. Demaine , and M Farach-Colton. Cache-oblivious B-trees. In Proc. IEEE Symposium on Foundations of Computer Science , pages 339 -- 409 , 2000 .]] M. A. Bender, E. D. Demaine, and M Farach-Colton. Cache-oblivious B-trees. In Proc. IEEE Symposium on Foundations of Computer Science, pages 339--409, 2000.]]"},{"key":"e_1_3_2_1_14_1","first-page":"29","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","author":"Bender M. A.","year":"2002","unstructured":"M. A. Bender , Z. Duan , J. Iacono , and J. Wu . A locality-preserving cache-oblivious dynamic dictionary . In Proc. ACM-SIAM Symposium on Discrete Algorithms , pages 29 -- 38 , 2002 .]] M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 29--38, 2002.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90117-0"},{"key":"e_1_3_2_1_16_1","first-page":"39","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms","author":"Brodal G. S.","year":"2002","unstructured":"G. S. Brodal , R. Fagerberg , and R. Jacob . Cache oblivious search trees via binary trees of small height . In Proc. ACM-SIAM Symposium on Discrete Algorithms , pages 39 -- 48 , 2002 .]] G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 39--48, 2002.]]"},{"key":"e_1_3_2_1_17_1","first-page":"219","volume-title":"Proc. International Symposium on Algorithms and Computation, LNCS 2518","author":"Brodal G. S.","year":"2002","unstructured":"G. S. Brodal and R. Fagerberg . Funnel heap - a cache oblivious priority queue . In Proc. International Symposium on Algorithms and Computation, LNCS 2518 , pages 219 -- 228 , 2002 .]] G. S. Brodal and R. Fagerberg. Funnel heap - a cache oblivious priority queue. In Proc. International Symposium on Algorithms and Computation, LNCS 2518, pages 219--228, 2002.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_22_1","volume-title":"Utrecht University","author":"Haverkort H. J.","year":"2004","unstructured":"H. J. Haverkort . Results on Geometric Networks and Data Structures. PhD thesis , Utrecht University , 2004 .]] H. J. Haverkort. Results on Geometric Networks and Data Structures. PhD thesis, Utrecht University, 2004.]]"},{"key":"e_1_3_2_1_23_1","first-page":"500","volume-title":"Proc. International Conference on Very Large Databases","author":"Kamel I.","year":"1994","unstructured":"I. Kamel and C. Faloutsos . Hilbert R-tree: An improved R-tree using fractals . In Proc. International Conference on Very Large Databases , pages 500 -- 509 , 1994 .]] I. Kamel and C. Faloutsos. Hilbert R-tree: An improved R-tree using fractals. In Proc. International Conference on Very Large Databases, pages 500--509, 1994.]]"},{"key":"e_1_3_2_1_24_1","first-page":"257","volume-title":"Proc. International Conference on Database Theory, LNCS 1540","author":"Kanth K. V. R.","year":"1999","unstructured":"K. V. R. Kanth and A. K. Singh . Optimal dynamic range searching in non-replicating index structures . In Proc. International Conference on Database Theory, LNCS 1540 , pages 257 -- 276 , 1999 .]] K. V. R. Kanth and A. K. Singh. Optimal dynamic range searching in non-replicating index structures. In Proc. International Conference on Database Theory, LNCS 1540, pages 257--276, 1999.]]"},{"key":"e_1_3_2_1_25_1","volume-title":"R-trees have grown everywhere. Submitted to ACM Computing Surveys","author":"Manolopoulos Y.","year":"2003","unstructured":"Y. Manolopoulos , A. Nanopoulos , A. N. Papadopoulos , and Y. Theodoridis . R-trees have grown everywhere. Submitted to ACM Computing Surveys , 2003 .]] Y. Manolopoulos, A. Nanopoulos, A. N. Papadopoulos, and Y. Theodoridis. R-trees have grown everywhere. Submitted to ACM Computing Surveys, 2003.]]"},{"key":"e_1_3_2_1_26_1","volume-title":"Master's thesis","author":"Prokop H.","year":"1999","unstructured":"H. Prokop . Cache-oblivious algorithms. Master's thesis , Massachusetts Institute of Technology , Cambridge, MA , June 1999 .]] H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/647258.720797"},{"key":"e_1_3_2_1_28_1","first-page":"507","volume-title":"Proc. International Conference on Very Large Databases","author":"Sellis T.","year":"1987","unstructured":"T. Sellis , N. Roussopoulos , and C. Faloutsos . The R+-tree: A dynamic index for multi-dimensional objects . In Proc. International Conference on Very Large Databases , pages 507 -- 518 , 1987 .]] T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: A dynamic index for multi-dimensional objects. In Proc. International Conference on Very Large Databases, pages 507--518, 1987.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"}],"event":{"name":"SoCG05: The 21st Annual ACM Symposium on Computational Geometry 2005","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Pisa Italy","acronym":"SoCG05"},"container-title":["Proceedings of the twenty-first annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064092.1064120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064092.1064120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:50Z","timestamp":1750262870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064092.1064120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,6]]},"references-count":29,"alternative-id":["10.1145\/1064092.1064120","10.1145\/1064092"],"URL":"https:\/\/doi.org\/10.1145\/1064092.1064120","relation":{},"subject":[],"published":{"date-parts":[[2005,6,6]]},"assertion":[{"value":"2005-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}