{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:49:22Z","timestamp":1792133362637,"version":"4.4.0"},"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_355","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T08:25:47Z","timestamp":1544084747000},"page":"3592-3598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spatial Indexing Techniques"],"prefix":"10.1007","author":[{"given":"Yannis","family":"Manolopoulos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"355_CR19888","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: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322\u201331.","DOI":"10.1145\/93597.98741"},{"issue":"1","key":"355_CR19889","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel RA, Bentley JL. Quad Trees: a data structure for retrieval on composite keys. Acta Informatica. 1974;4(1):1\u20139.","journal-title":"Acta Informatica"},{"issue":"2","key":"355_CR19890","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/568271.223796","volume":"24","author":"Michael Freeston","year":"1995","unstructured":"Freeston MA. General solution of the n-dimensional B-tree problem. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1995. p. 80\u201391.","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"355_CR19891","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, Guenther O. Multidimensional access methods. ACM Comput Surv. 1998;30(2):170\u2013231.","journal-title":"ACM Comput Surv"},{"key":"355_CR19892","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"},{"issue":"4","key":"355_CR19893","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10707-005-4577-6","volume":"9","author":"M Hadjieleftheriou","year":"2005","unstructured":"Hadjieleftheriou M, Hoel E, Tsotras VJ. SaIL: a spatial index library for efficient application integration. GeoInformatica. 2005;9(4):367\u201389.","journal-title":"GeoInformatica"},{"key":"355_CR19894","unstructured":"Henrich A, Six H-W, Widmayer P. The LSD tree: spatial access to multidimensional point and non point objects. In: Proceedings of the 15th International Conference on Very Large Data Bases; 1989. p. 43\u201353."},{"key":"355_CR19895","unstructured":"Kamel I, Faloutsos C. Hilbert R-tree: an improved R-tree using fractals. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 500\u201309."},{"issue":"4","key":"355_CR19896","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1145\/99935.99949","volume":"15","author":"DB Lomet","year":"1990","unstructured":"Lomet DB, Salzberg B. The hB-tree: a multiattribute indexing method with good guaranteed performance. ACM Trans Database Syst. 1990;15(4): 625\u201358.","journal-title":"ACM Trans Database Syst"},{"issue":"1","key":"355_CR19897","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"Nievergelt J, Hinterberger H, Sevcik KC. The grid file: an adaptable symmetric multikey file structure. ACM Trans Database Syst. 1984;9(1): 38\u201371.","journal-title":"ACM Trans Database Syst"},{"issue":"4","key":"355_CR19898","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/971699.318900","volume":"14","author":"Nick Roussopoulos","year":"1985","unstructured":"Roussopoulos N, Leifker D. Direct spatial search on pictorial databases using packed R-trees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1985. p. 17\u201331.","journal-title":"ACM SIGMOD Record"},{"key":"355_CR19899","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F. Nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1995. p. 71\u20139.","DOI":"10.1145\/223784.223794"},{"key":"355_CR19900","doi-asserted-by":"crossref","unstructured":"Samet H. The design and analysis of spatial data structures. Addison-Wesley; Reading, MA, 1990.","DOI":"10.1007\/3-540-52208-5_28"},{"key":"355_CR19901","unstructured":"Seeger B, Kriegel H-P. The Buddy-tree: an efficient and robust access method for spatial database systems. In: Proceedings of the 16th International Conference on Very Large Data Bases; 1990. p. 590\u2013601."},{"key":"355_CR19902","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_355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:31:02Z","timestamp":1792132262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4614-8265-9_355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_355","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}