{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T17:14:54Z","timestamp":1790702094890,"version":"4.1.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319228488","type":"print"},{"value":"9783319228495","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22849-5_4","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T12:07:51Z","timestamp":1439208471000},"page":"43-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The xBR$$^+$$-tree: An Efficient Access Method for Points"],"prefix":"10.1007","author":[{"given":"George","family":"Roumelis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thanasis","family":"Loukopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R Finkel","year":"1974","unstructured":"Finkel, R., Bentley, J.: Quad trees: a data structure for retrieval on composite keys. Acta Informatica 4, 1\u20139 (1974)","journal-title":"Acta Informatica"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede, V., Gunther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"key":"4_CR4","volume-title":"New Trends in Data Warehousing and Data Analysis","author":"M Gorawski","year":"2009","unstructured":"Gorawski, M., Bugdol, M.: Cost Model for XBR-tree. In: Kozielski, S., Wrembel, R. (eds.) New Trends in Data Warehousing and Data Analysis. Springer, USA (2009)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Hoel, E.G., Samet, H.: A qualitative comparison study of data structures for large line segment databases. In: SIGMOD Conference, pp. 205\u2013214 (1992)","DOI":"10.1145\/141484.130316"},{"key":"4_CR6","unstructured":"Hoel, E.G., Samet, H.: Benchmarking spatial join operations with spatial output. In: VLDB Conference, pp. 606\u2013618 (1995)"},{"issue":"7","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/TKDE.2009.141","volume":"22","author":"YJ Kim","year":"2010","unstructured":"Kim, Y.J., Patel, J.: Performance comparison of the R*-tree and the quadtree for kNN and distance join queries. IEEE Trans. Knowl. Data Eng. 22(7), 1014\u20131027 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR8","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, A., Theodoridis, Y.: R-Trees: Theory and Applications. Springer, London (2006)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Roumelis, G., Vassilakopoulos, M., Corral, A.: Algorithms for processing Nearest Neighbor Queries using xBR-trees. In: Panhellenic Conference on Informatics, pp. 51\u201355 (2011)","DOI":"10.1109\/PCI.2011.22"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-23737-9_17","volume-title":"Advances in Databases and Information Systems","author":"G Roumelis","year":"2011","unstructured":"Roumelis, G., Vassilakopoulos, M., Corral, A.: Performance comparison of xBR-trees and R*-trees for single dataset spatial queries. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol. 6909, pp. 228\u2013242. Springer, Heidelberg (2011)"},{"key":"4_CR11","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H Samet","year":"1990","unstructured":"Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Boston (1990)"},{"key":"4_CR12","volume-title":"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS","author":"H Samet","year":"1990","unstructured":"Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Boston (1990)"},{"key":"4_CR13","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers, San Francisco (2006)"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structure. Comput. Surv. 16(2), 187\u2013260 (1984)","journal-title":"Comput. Surv."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Vassilakopoulos, M., Manolopoulos, Y.: External balanced regular (x-BR) trees: new structures for very large spatial databases. In: Panhellenic Conference on Informatics, pp. 324\u2013333 (2000)","DOI":"10.1142\/9789812793928_0029"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-18302-7_12","volume-title":"Transactions on Rough Sets XIII","author":"X Yin","year":"2011","unstructured":"Yin, X., D\u00fcntsch, I., Gediga, G.: Quadtree representation and compression of spatial data. In: Peters, J.F., Skowron, A., Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) Transactions on Rough Sets XIII. LNCS, vol. 6499, pp. 207\u2013239. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22849-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:21:24Z","timestamp":1674908484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22849-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228488","9783319228495"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22849-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}