{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:44:46Z","timestamp":1742402686110,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540075448"},{"type":"electronic","value":"9783540380764"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-38076-0_1","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:30:01Z","timestamp":1180823401000},"page":"1-18","source":"Crossref","is-referenced-by-count":2,"title":["Processing Distance-Based Queries in Multidimensional 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":[[2003,6,25]]},"reference":[{"issue":"6","key":"1_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":"1_CR2","doi-asserted-by":"crossref","unstructured":"B. Braunmuller, M. Ester, H.P. Kriegel and J. Sander: \u201cEfficiently Supporting Multiple Similarity Queries for Mining in Metric Databases\u201d, Proceedings ICDE Conference, pp.256\u2013267, 2000.","DOI":"10.1109\/ICDE.2000.839418"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"K. S. Beyer, J. Goldstein, R. Ramakrishnan and U. Shaft: \u201cWhen Is \u201cNearest Neighbor\u201d Meaningful?\u201d, Proceedings 7th ICDT Conference, pp.217\u2013235, 1999.","DOI":"10.1007\/3-540-49257-7_15"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger: \u201cThe R*-tree: and Efficient and Robust Access Method for Points and Rectangles\u201d, Proceedings 1990 ACM SIGMOD Conference, pp.322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"1_CR5","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, 1996."},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K. L. Cheung","year":"1998","unstructured":"K. L. Cheung and A.W. Fu: \u201cEnhanced Nearest Neighbour Search on the R-tree\u201d, ACM SIGMOD Record, Vol.27, No.3, pp.16\u201321, 1998.","journal-title":"ACM SIGMOD Record"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"P. Ciaccia and M. Patella; \u201cPAC Nearest Neighbor Queries: Approximate and Controlled Searchin High-Dimensional and Metric Spaces\u201d, Proceedings ICDE Conference, pp. 244\u2013255, San Diego, CA, 2000.","DOI":"10.1109\/ICDE.2000.839417"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"A. Corral, J. Ca\u00f1adas and M. Vassilakopoulos: \u201cApproximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees\u201d, Proceedings 6th ADBIS Conference, pp. 163\u2013176, 2002.","DOI":"10.1007\/3-540-45710-0_14"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: \u201cClosest Pair Queries in Spatial Databases\u201d, Proceedings 2000 ACM SIGMOD Conference, pp.189\u2013200, 2000.","DOI":"10.1145\/342009.335414"},{"key":"1_CR10","unstructured":"A. Corral, J. Rodriguez and M. Vassilakopoulos: \u201cDistance-Based Queries in Multidimensional Data Spaces using R-trees\u201d, Proceedings 8th Panhellenic Conference on Informatics, Vol.I, pp.237\u2013246, Nicosia, Cyprus, 2001."},{"key":"1_CR11","unstructured":"T. Dean and M. S. Boddy: \u201cAn Analysis of Time-Dependent Planning\u201d, Proceedings AAAI Conference, pp.49\u201354, St. Paul, MN, 1988. 17"},{"issue":"3","key":"1_CR12","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 Systems, Vol.3, No.3\u20134, pp.231\u2013262, 1994. 1","journal-title":"Journal of Intelligent Information Systems"},{"issue":"2","key":"1_CR13","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. 2","journal-title":"ACM Computing Surveys"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"A. Guttman: \u201cR-trees: A Dynamic Index Structure for Spatial Searching\u201d, Proceedings 1984 ACM SIGMOD Conference, pp.47\u201357, 1984. 2, 4","DOI":"10.1145\/602259.602266"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"G.R. Hjaltason and H. Samet: \u201cRanking in Spatial Databases\u201d, Proceedings 4th SSD Conference, pp.83\u201395, 1995. 3","DOI":"10.1007\/3-540-60159-7_6"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"G.R. Hjaltason and H. Samet: \u201cIncremental Distance Join Algorithms for Spatial Databases\u201d, Proceedings 1998 ACM SIGMOD Conference, pp.237\u2013248, 1998. 4","DOI":"10.1145\/276304.276326"},{"issue":"2","key":"1_CR17","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. 3, 8, 17","journal-title":"ACM Transactions on Database Systems"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"H.V. Jagadish: \u201cA Retrieval Technique for Similar Shapes\u201d, Proceedings 1991 ACM SIGMOD Conference, pp.208\u2013217, 1991. 1","DOI":"10.1145\/115790.115821"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"N. Katayama and S. Satoh: \u201cThe SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries\u201d, Proceedings 1997 ACM SIGMOD Conference, pp.369\u2013380, 1997. 17","DOI":"10.1145\/253260.253347"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"N. Koudas and K. C. Sevcik: \u201cHighD imensional Similarity Joins: Algorithms and Performance Evaluation\u201d, Proceedings ICDE Conference, pp. 466\u2013475, Orlando, FL, 1998. 6","DOI":"10.1109\/ICDE.1998.655809"},{"key":"1_CR21","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, 1996. 1"},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. I. Lin","year":"1994","unstructured":"K. I. Lin, H. V. Jagadishand C. Faloutsos: \u201cThe TV-tree: an Index Structure for High-Dimensional Data\u201d, The VLDB Journal, Vol.3, No.4, pp.517\u2013542, 1994. 5","journal-title":"The VLDB Journal"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and M. I. Shamos: \u201cComputational Geometry: an Introduction\u201d, Springer, 1985. 4, 9","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley and F. Vincent: \u201cNearest Neighbor Queries\u201d, Proceedings 1995 ACM SIGMOD Conference, pp.71\u201379, 1995. 3, 7, 8","DOI":"10.1145\/223784.223794"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"H. Shin, B. Moon and S. Lee: \u201cAdaptive Multi-Stage Distance Join Processing\u201d, Proceedings 2000 ACM SIGMOD Conference, pp.343\u2013354, 2000. 4","DOI":"10.1145\/342009.335428"},{"key":"1_CR26","unstructured":"Y. Sakurai, M. Yoshikawa, S. Uemura and H. Kojima: \u201cThe A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation\u201d, Proceedings 26th VLDB Conference, pp.516\u2013526, 2000. 17"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38076-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:46:28Z","timestamp":1737063988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38076-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540075448","9783540380764"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-38076-0_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}