{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T15:27:38Z","timestamp":1794583658483,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":15,"publisher":"Springer New York","isbn-type":[{"value":"9781461482666","type":"print"},{"value":"9781461482659","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4614-8265-9_300","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T06:56:50Z","timestamp":1544079410000},"page":"3258-3265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["R-Tree (and Family)"],"prefix":"10.1007","author":[{"given":"Apostolos N.","family":"Papadopoulos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandros","family":"Nanopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"300_CR18544","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Seeger B. The R.*-tree: an efficient and robust method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322\u201331.","DOI":"10.1145\/93597.98741"},{"key":"300_CR18545","unstructured":"Berchtold S, Keim DA, Kriegel HP. The X-tree: an index structure for high-dimensional data. In: Proceedings of 22nd International Conference on Very Large Data Bases; 1996. p. 28\u201339."},{"key":"300_CR18546","doi-asserted-by":"crossref","unstructured":"Chen L, Choubey R, Rundensteiner EA. Bulk-insertions into R-trees using the small-tree-large-tree approach. In: Proceedings of 6th International Symposium on Advances in Geographic Information Systems; 1998. p. 161\u20132.","DOI":"10.1145\/288692.288722"},{"key":"300_CR18547","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-48482-5_8","volume-title":"Advances in Spatial Databases","author":"Rupesh Choubey","year":"1999","unstructured":"Choubey R, Chen L, Rundensteiner EA. GBI \u2013 a generalized R-tree bulk-insertion strategy. In: Proceedings of 6th International Symposium on Advances in Spatial Databases; 1999. p. 91\u2013108."},{"key":"300_CR18548","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1445-5","volume-title":"Searching multimedia databases by content","author":"C Faloutsos","year":"1996","unstructured":"Faloutsos C. Searching multimedia databases by content. Dordecht: Kluwer; 1996."},{"key":"300_CR18549","doi-asserted-by":"crossref","unstructured":"Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1984. p. 47\u201357.","DOI":"10.1145\/971697.602266"},{"key":"300_CR18550","doi-asserted-by":"crossref","unstructured":"Kamel I, Faloutsos C. On packing R-trees. In: Proceedings of the 2nd International Conference on Information and Knowledge Management; 1993. p. 490\u20139.","DOI":"10.1145\/170088.170403"},{"key":"300_CR18551","unstructured":"Kamel I, Faloutsos C. Hilbert R-tree \u2013 an improved R-tree using fractals. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 500\u20139."},{"key":"300_CR18552","doi-asserted-by":"crossref","unstructured":"Leutenegger S, Edgington JM, Lopez MA. STR \u2013 a simple and efficient algorithm for R-tree packing. In: Proceedings of the 13th International Conference on Data Engineering; 1997. p. 497\u2013506.","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"(4)","key":"300_CR18553","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K Lin","year":"1994","unstructured":"Lin K, Jagadish HV, Faloutsos C. The TV-tree: an index structure for high-dimensional data. VLDB J. 1994;3(4):517\u201342.","journal-title":"VLDB J"},{"key":"300_CR18554","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-293-5","volume-title":"R-trees: theory and applications","author":"Y Manolopoulos","year":"2006","unstructured":"Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y. R-trees: theory and applications. Berlin: Springer; 2006."},{"key":"300_CR18555","doi-asserted-by":"crossref","unstructured":"du Mouza C, Litwin W, Rigaux P. SD-Rtree: a scalable distributed R-tree. In: Proceedings of the 23rd International Conference on Data Engineering; 2007. p. 296\u2013305.","DOI":"10.1109\/ICDE.2007.367875"},{"issue":"4","key":"300_CR18556","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/971699.318900","volume":"14","author":"N Roussopoulos","year":"1985","unstructured":"Roussopoulos N, Leifker D. Direct spatial search on pictorial databases using packed R-trees. ACM SIGMOD Rec. 1985;14(4):17\u201331.","journal-title":"ACM SIGMOD Rec"},{"issue":"2","key":"300_CR18557","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00778-002-0066-9","volume":"11","author":"Y Sakurai","year":"2002","unstructured":"Sakurai Y, Yoshikawa M, Uemura S, Kojima H. Spatial indexing of high-dimensional data based on relative approximation. VLDB J. 2002;11(2):93\u2013108.","journal-title":"VLDB J"},{"key":"300_CR18558","unstructured":"Sellis T, Roussopoulos N, Faloutsos C. The R+-tree: a dynamic index for multidimensional objects. In: Proceedings of the 13th International Conference on Very Large Data Bases; 1987. p. 507\u201318."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-8265-9_300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:25:23Z","timestamp":1792131923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4614-8265-9_300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_300","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}