{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T21:02:57Z","timestamp":1769202177648,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T00:00:00Z","timestamp":1246233600000},"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":[[2009,6,29]]},"DOI":"10.1145\/1559845.1559929","type":"proceedings-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:34:19Z","timestamp":1247074459000},"page":"799-812","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":69,"title":["A revised r*-tree in comparison with related index structures"],"prefix":"10.1145","author":[{"given":"Norbert","family":"Beckmann","sequence":"first","affiliation":[{"name":"University of Bremen, Bremen, Germany"}]},{"given":"Bernhard","family":"Seeger","sequence":"additional","affiliation":[{"name":"University of Marburg, Marburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2009,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007608"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_4_1","volume-title":"STACS 1992:  475--486","author":"Becker B.","unstructured":"B. Becker , P. Franciosa , S. Gschwind , T. Ohler , G. Thiemt , P. Widmayer : Enclosing Many Boxes by an Optimal Pair of Boxes . STACS 1992: 475--486 . B. Becker, P. Franciosa, S. Gschwind, T. Ohler, G. Thiemt, P. Widmayer: Enclosing Many Boxes by an Optimal Pair of Boxes. STACS 1992: 475--486."},{"key":"e_1_3_2_1_5_1","volume-title":"Kriegel: The X-tree: An Index Structure for High-Dimensional Data. VLDB Conference 1996:  28--39","author":"Berchtold S.","unstructured":"S. Berchtold , D. Keim , H.- P. Kriegel: The X-tree: An Index Structure for High-Dimensional Data. VLDB Conference 1996: 28--39 . S. Berchtold, D. Keim, H.-P. Kriegel: The X-tree: An Index Structure for High-Dimensional Data. VLDB Conference 1996: 28--39."},{"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","first-page":"406","article-title":"A Generic Approach to Bulk Loading Multidimensional Index Structures","volume":"1997","author":"van den Bercken J.","unstructured":"J. van den Bercken , B. Seeger , P. Widmayer : A Generic Approach to Bulk Loading Multidimensional Index Structures . VLDB 1997 : 406 -- 415 . J. van den Bercken, B. Seeger, P. Widmayer: A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997: 406--415.","journal-title":"VLDB"},{"key":"e_1_3_2_1_8_1","volume-title":"Tiger\/Line Precensus Files: 1995 technical documentation","author":"Bureau of the Census","year":"1996","unstructured":"Bureau of the Census : Tiger\/Line Precensus Files: 1995 technical documentation , Bureau of the Census, Washington DC 1996 . Bureau of the Census: Tiger\/Line Precensus Files: 1995 technical documentation, Bureau of the Census, Washington DC 1996."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191915"},{"key":"e_1_3_2_1_10_1","volume-title":"ICDE 1999:  440--447","author":"Chakrabarti K.","unstructured":"K. Chakrabarti , S. Mehrotra . The hybrid tree: An index structure for high dimensional feature spaces . ICDE 1999: 440--447 . K. Chakrabarti, S. Mehrotra. The hybrid tree: An index structure for high dimensional feature spaces. ICDE 1999: 440--447."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304185"},{"key":"e_1_3_2_1_12_1","unstructured":"http:\/\/www.mathematik.uni-marburg.de\/~seeger\/rrstar\/ 2009.  http:\/\/www.mathematik.uni-marburg.de\/~seeger\/rrstar\/ 2009."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/182591.182593"},{"key":"e_1_3_2_1_14_1","volume-title":"S. Leutenegger: On Optimal Node Splitting for R-trees. VLDB Conference 1998:  334--344","author":"Garc\u00eda Y.","unstructured":"Y. Garc\u00eda , M. Lopez , S. Leutenegger: On Optimal Node Splitting for R-trees. VLDB Conference 1998: 334--344 . Y. Garc\u00eda, M. Lopez, S. Leutenegger: On Optimal Node Splitting for R-trees. VLDB Conference 1998: 334--344."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_16_1","volume-title":"VLDB Conference 1995:  562--573","author":"Hellerstein J. M.","unstructured":"J. M. Hellerstein , J. F. Naughton , and A. Pfeffer . Generalized Search Trees for Database Systems (Extended Abstract) . VLDB Conference 1995: 562--573 . J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems (Extended Abstract). VLDB Conference 1995: 562--573."},{"key":"e_1_3_2_1_17_1","volume-title":"H. Samet: Benchmarking Spatial Join Operations with Spatial Output. VLDB Conference 1995:  606--618","author":"Hoel E.","unstructured":"E. Hoel , H. Samet: Benchmarking Spatial Join Operations with Spatial Output. VLDB Conference 1995: 606--618 . E. Hoel, H. Samet: Benchmarking Spatial Join Operations with Spatial Output. VLDB Conference 1995: 606--618."},{"key":"e_1_3_2_1_18_1","volume-title":"Feb.","author":"Index IBM","year":"2009","unstructured":"IBM Informix R-tree Index , User's Guide, 2005. IBM Informix Dynamic Server v10 Information Center , Feb. 2009 . IBM Informix R-tree Index, User's Guide, 2005. IBM Informix Dynamic Server v10 Information Center, Feb. 2009."},{"key":"e_1_3_2_1_19_1","volume-title":"VLDB Conference 1994:  500--509","author":"Kamel I.","unstructured":"I. Kamel , C. Faloutsos , \"Hilbert R-tree : An Improved R-tree Using Fractals \", VLDB Conference 1994: 500--509 . I. Kamel, C. Faloutsos, \"Hilbert R-tree: An Improved R-tree Using Fractals\", VLDB Conference 1994: 500--509."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253272"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564755"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304240"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"e_1_3_2_1_24_1","volume-title":"Theodoridis: R-trees: Theory and Applications","author":"Manolopoulos Y.","year":"2005","unstructured":"Y. Manolopoulos , A. Nanopoulos , A. N. Papadopoulos , Y. Theodoridis: R-trees: Theory and Applications , Springer , 2005 . Y. Manolopoulos, A. Nanopoulos, A. N. Papadopoulos, Y. Theodoridis: R-trees: Theory and Applications, Springer, 2005."},{"key":"e_1_3_2_1_25_1","volume-title":"http:\/\/downloads.mysql.com\/docs\/refman-5.0-en.a4.pdf","author":"Reference Manual SQL","year":"2008","unstructured":"My SQL 5.0 Reference Manual , http:\/\/downloads.mysql.com\/docs\/refman-5.0-en.a4.pdf , 2008 . MySQL 5.0 Reference Manual, http:\/\/downloads.mysql.com\/docs\/refman-5.0-en.a4.pdf, 2008."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.143648"},{"key":"e_1_3_2_1_27_1","unstructured":"The PostgreSQL Comprehensive Manual http:\/\/www.postgresql.org\/docs\/manuals\/).  The PostgreSQL Comprehensive Manual http:\/\/www.postgresql.org\/docs\/manuals\/)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/153850.153878"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/212433.212458"},{"key":"e_1_3_2_1_30_1","volume-title":"VLDB Conference 2000:  516--526","author":"Sakurai Y.","unstructured":"Y. Sakurai , M. Yoshikawa , S. Uemura , and H. Kojima : \" The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation \", VLDB Conference 2000: 516--526 . Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima: \"The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation\", VLDB Conference 2000: 516--526."},{"key":"e_1_3_2_1_31_1","volume-title":"http:\/\/kdd.ics.uci.edu\/","author":"Archive UC","year":"2002","unstructured":"UC Irvine KDD Archive , http:\/\/kdd.ics.uci.edu\/ , 2002 . UC Irvine KDD Archive, http:\/\/kdd.ics.uci.edu\/, 2002."},{"issue":"2","key":"e_1_3_2_1_32_1","volume":"6","author":"Weinberger J.","year":"2001","unstructured":"J. Weinberger : SpatialWare Extends Microsoft SQL Server Capabilities. MapInfo Magazine 6 ( 2 ), 2001 . J. Weinberger: SpatialWare Extends Microsoft SQL Server Capabilities. MapInfo Magazine 6(2), 2001.","journal-title":"SpatialWare Extends Microsoft SQL Server Capabilities. MapInfo Magazine"}],"event":{"name":"SIGMOD\/PODS '09: International Conference on Management of Data","location":"Providence Rhode Island USA","acronym":"SIGMOD\/PODS '09","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2009 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559929","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1559845.1559929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:12Z","timestamp":1750249092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,29]]},"references-count":32,"alternative-id":["10.1145\/1559845.1559929","10.1145\/1559845"],"URL":"https:\/\/doi.org\/10.1145\/1559845.1559929","relation":{},"subject":[],"published":{"date-parts":[[2009,6,29]]},"assertion":[{"value":"2009-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}