{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:15:23Z","timestamp":1778249723703,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441380","type":"print"},{"value":"9783540457107","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45710-0_14","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T20:29:40Z","timestamp":1181680180000},"page":"163-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Corral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaquin","family":"Ca\u00f1adas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu; \u201cAn Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions\u201d, Journal of the ACM, Vol.45, No.6, pp.891\u2013923, 1998.","journal-title":"Journal of the ACM"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger; \u201cThe R*-tree: An Efficient and Robust Access Method for Points and Rectangles\u201d, Proceedings ACM SIGMOD Conference, pp. 322\u2013331, Atlantic City, NJ, 1990.","DOI":"10.1145\/93597.98741"},{"key":"14_CR3","unstructured":"S. Berchtold, D. Kiem, and H.P. Kriegel;\u201cThe X-tree: An Index Structure for High-Dimensional Data\u201d, Proceedings 22nd VLDB Conference pp. 28\u201339, Bombay, India, 1996."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"C. Bohm and H.P. Kriegel;\u201cA Cost Model and Index Architecture for the Similarity Join\u201d, Proceedings IEEE ICDE Conference, pp. 411\u2013420, Heidelberg, Germany, 2001.","DOI":"10.1109\/ICDE.2001.914854"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"P. Ciaccia and M. Patella;\u201cPAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces\u201d, Proceedings IEEE ICDE Conference, pp. 244\u2013255, San Diego, CA, 2000.","DOI":"10.1109\/ICDE.2000.839417"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"K.L. Clarkson;\u201cAn Algorithm for Approximate Closest-Point Queries\u201d, Proceedings 10th ACM Symposium on Computational Geometry, New York, pp. 160\u2013164. 1994.","DOI":"10.1145\/177424.177609"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos;\u201cClosest Pair Queries in Spatial Databases\u201d, Proceedings ACM SIGMOD Conference, pp. 189\u2013200, Dallas, TX, 2000.","DOI":"10.1145\/342009.335414"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C. Faloutsos","year":"1994","unstructured":"C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz;\u201cEfficient and Effective Querying by Image Content\u201d, Journal of Intelligent Information System, Vol.3, No.3\u20134, pp.231\u2013262, 1994.","journal-title":"Journal of Intelligent Information System"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. Gunther;\u201cMultidimensional Access Methods\u201d, ACM Computing Surveys, Vol.30, No.2, pp.170\u2013231, 1998.","journal-title":"ACM Computing Surveys"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"A. Guttman;\u201cR-trees: A Dynamic Index Structure for Spatial Searching\u201d, Proceedings ACM SIGMOD Conference, pp.47\u201357, Boston, MA, 1984.","DOI":"10.1145\/971697.602266"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"G.R. Hjaltason and H. Samet;\u201cIncremental Distance Join Algorithms for Spatial Databases\u201d, Proceedings ACM SIGMOD Conference, pp.237\u2013248, Seattle, WA, 1998.","DOI":"10.1145\/276304.276326"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"G.R. Hjaltason and H. Samet;\u201cDistance Browsing in Spatial Databases\u201d, ACM Transactions on Database Systems, Vol.24, No.2, pp.265\u2013318, 1999.","journal-title":"ACM Transactions on Database Systems"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"N. Koudas and K.C. Sevcik;\u201cHigh Dimensional Similarity Joins: Algorithms and Performance Evaluation\u201d, Proceedings IEEE ICDE Conference, pp.466\u2013475, Orlando, FL, 1998.","DOI":"10.1109\/ICDE.1998.655809"},{"key":"14_CR14","unstructured":"F. Korn, N. Sidiropoulos, C. Faloutsos, C. Siegel, and Z. Protopapas;\u201cFast Nearest Neighbor Search in Medical Images Databases\u201d, Proceedings 22nd VLDB Conference pp.215\u2013226, Bombay, India, 1996."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley, and F. Vincent;\u201cNearest Neighbor Queries\u201d, Proceedings ACM SIGMOD Conference, pp.71\u201379, San Jose, CA, 1995.","DOI":"10.1145\/568271.223794"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"H. Shin, B. Moon, and S. Lee;\u201cAdaptive Multi-stage Distance Join Processing\u201d, Proceedings ACM SIGMOD Conference, pp.343\u2013354, Dallas, TX, 2000.","DOI":"10.1145\/342009.335428"},{"key":"14_CR17","unstructured":"K. Shim, R. Srikant, and R. Agrawal;\u201cHigh-Dimensional Similarity Joins\u201d, Proceedings IEEE ICDE Conference, pp.301\u2013311, Birmingham, UK, 1997."}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45710-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:45:51Z","timestamp":1778247951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45710-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441380","9783540457107"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45710-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"23 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}