{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:49:38Z","timestamp":1750830578980,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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":[[2004,6,13]]},"DOI":"10.1145\/1007568.1007608","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"347-358","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":64,"title":["The Priority R-tree"],"prefix":"10.1145","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[{"name":"Duke University, Durham, NC"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[{"name":"TU Eindhoven, Eindhoven, The Netherlands"}]},{"given":"Herman J.","family":"Haverkort","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, The Netherlands"}]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684250"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-002-2817-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740668"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2003.04.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645338.650117"},{"key":"e_1_3_2_1_8_1","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"Chazelle B.","year":"2001","unstructured":"B. Chazelle . The Discrepancy Method: Randomness and Complexity . Cambridge University Press , New York , 2001 .]] B. Chazelle. The Discrepancy Method: Randomness and Complexity. Cambridge University Press, New York, 2001.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_10_1","first-page":"558","volume-title":"Proc. International Conference on Very Large Databases","author":"DeWitt D. J.","year":"1994","unstructured":"D. J. DeWitt , N. Kabra , J. Luo , J. M. Patel , and J.-B. Yu . Client-server paradise . In Proc. International Conference on Very Large Databases , pages 558 -- 569 , 1994 .]] D. J. DeWitt, N. Kabra, J. Luo, J. M. Patel, and J.-B. Yu. Client-server paradise. In Proc. International Conference on Very Large Databases, pages 558--569, 1994.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/288692.288723"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/513400.513407"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/170088.170403"},{"key":"e_1_3_2_1_16_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_17_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_18_1","first-page":"497","volume-title":"Proc. IEEE International Conference on Data Engineering","author":"Leutenegger S. T.","year":"1996","unstructured":"S. T. Leutenegger , M. A. L\u00f3pez , and J. Edgington . STR: A simple and efficient algorithm for R-tree packing . In Proc. IEEE International Conference on Data Engineering , pages 497 -- 506 , 1996 .]] S. T. Leutenegger, M. A. L\u00f3pez, and J. Edgington. STR: A simple and efficient algorithm for R-tree packing. In Proc. IEEE International Conference on Data Engineering, pages 497--506, 1996.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45072-6_4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/318898.318900"},{"key":"e_1_3_2_1_23_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.]]"},{"volume-title":"DC","year":"1997","key":"e_1_3_2_1_24_1","unstructured":"TIGER\/Line#8482; Files , 1997 Technical Documentation. Washington , DC , September 1998. http:\/\/www.census.gov\/geo\/tiger\/TIGER97D.pdf.]] TIGER\/Line#8482; Files, 1997 Technical Documentation. Washington, DC, September 1998. http:\/\/www.census.gov\/geo\/tiger\/TIGER97D.pdf.]]"}],"event":{"name":"SIGMOD\/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Paris France","acronym":"SIGMOD\/PODS04"},"container-title":["Proceedings of the 2004 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007608","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007568.1007608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:32Z","timestamp":1750264292000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007608"}},"subtitle":["a practically efficient and worst-case optimal R-tree"],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":23,"alternative-id":["10.1145\/1007568.1007608","10.1145\/1007568"],"URL":"https:\/\/doi.org\/10.1145\/1007568.1007608","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}