{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T17:27:12Z","timestamp":1749490032373},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414568"},{"type":"electronic","value":"9783540445036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_28","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:25:32Z","timestamp":1186878332000},"page":"435-449","source":"Crossref","is-referenced-by-count":9,"title":["On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Berchtold","sequence":"first","affiliation":[]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Keim","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Krebs","sequence":"additional","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. F. Altschul","year":"1990","unstructured":"Altschul S. F., Gish W., Miller W., Myers E. W., Lipman D. J.: \u2018A Basic Local Alignment Search Tool\u2019, Journal of Molecular Biology, Vol. 215, No. 3, 1990, pp. 403\u2013410.","journal-title":"Journal of Molecular Biology"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann N., Kriegel H.-P., Schneider R., Seeger B.: \u2018The R*-tree: An Efficient and Robust Access Method for Points and Rectangles\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, 1990, pp. 322\u2013331.","DOI":"10.1145\/93597.98741"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Keim D., Kriegel H.-P.: \u2018A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space\u2019, Proc. ACM PODS Int. Conf. on Principles of Databases, Tucson, Arizona, 1997.","DOI":"10.1145\/263661.263671"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Braunm\u00fcller B., Keim D., Kriegel H.-P.: \u2018Fast Parallel Similarity Search in Multimedia Databases\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, Tucson, Arizona, 1997.","DOI":"10.1145\/253260.253263"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Berchtold S., Keim D. A.: \u2018High-dimensional Index Structures: Database Support for Next Decades\u2019s Applications\u2019, Tutorial, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1998, p. 501.","DOI":"10.1145\/276304.276353"},{"key":"28_CR6","unstructured":"Berchtold S., Keim D., Kriegel H.-P.: \u2018The X-tree: An Index Structure for High-Dimensional Data\u2019, 22nd Conf. on Very Large Databases, 1996, Bombay, India."},{"key":"28_CR7","unstructured":"Berchtold S., Keim D., Kriegel H.-P.: \u2018Fast Searching for Partial Similarity in Polygon Databases\u2019, VLDB Journal, Dec. 1997."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Ciacia P., Patella M., Zezula P.: \u2018A Cost Model for Similarity Queries in Metric Spaces\u2019, Proc. ACM PODS Int. Conf. on Principals of Databases, Seattle, WA, 1998, pp. 59\u201368.","DOI":"10.1145\/275487.275495"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/355826.355832","volume":"5","author":"J. G. Cleary","year":"1979","unstructured":"Cleary J. G.: \u2018Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space\u2019, ACM Transactions on Mathematical Software, Vol. 5, No. 2, June 1979, pp.183\u2013192.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C. Faloutsos","year":"1994","unstructured":"Faloutsos C., Barber R., Flickner M., Hafner J., et al.: \u2018Efficient and Effective Querying by Image Content\u2019, Journal of Intelligent Information Systems, 1994, Vol. 3, pp. 231\u2013262.","journal-title":"Journal of Intelligent Information Systems"},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. H. Friedman","year":"1977","unstructured":"Friedman J. H., Bentley J. L., Finkel R. A.: \u201cAn Algorithm for Finding Best Matches in Logarithmic Expected Time\u201d, ACM Transactions on Mathematical Software, Vol. 3, No. 3, September 1977, pp. 209\u2013226.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Hjaltason G. R., Samet H.: \u2018Ranking in Spatial Databases\u2019, Proc. 4th Int. Symp. on Large Spatial Databases, Portland, ME, 1995, pp. 83\u201395.","DOI":"10.1007\/3-540-60159-7_6"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Katayama N., Satoh S.: \u2018The SR-Tree: An Index Structure for High-Dimensional Nearest Neighbor Queries\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997.","DOI":"10.1145\/253260.253347"},{"issue":"4","key":"28_CR14","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1992","unstructured":"Kukich K.: \u2018Techniques for Automatically Correcting Words in Text\u2019, ACM Computing Surveys, Vol. 24, No. 4, 1992, pp. 377\u2013440.","journal-title":"ACM Computing Surveys"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Jagadish H. V.: \u2018A Retrieval Technique for Similar Shapes\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1991, pp. 208\u2013217.","DOI":"10.1145\/115790.115821"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. Lin","year":"1995","unstructured":"Lin K., Jagadish H. V., Faloutsos C.: \u2018The TV-tree: An Index Structure for High-Dimensional Data\u2019, VLDB Journal, Vol. 3, 1995, pp. 517\u2013542.","journal-title":"VLDB Journal"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Mehrotra R., Gary J. E.: \u2018Feature-Based Retrieval of Similar Shapes\u2019, Proc. 9th Int. Conf. on Data Engineering, Vienna, Austria, 1993, pp. 108\u2013115.","DOI":"10.1109\/ICDE.1993.344072"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Mehrotra R., Gary J. E.: \u2018Feature-Index-Based Similar Shape Retrieval\u2019, Proc. of the 3rd Working Conf. on Visual Database Systems, March 1995.","DOI":"10.1007\/978-0-387-34905-3_4"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Roussopoulos N., Kelley S., Vincent F.: \u2018Nearest Neighbor Queries\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1995, pp. 71\u201379.","DOI":"10.1145\/223784.223794"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Shawney H., Hafner J.: \u2018Efficient Color Histogram Indexing\u2019, Proc. Int. Conf. on Image Processing, 1994, pp. 66\u201370.","DOI":"10.1109\/ICIP.1994.413532"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1002\/jcc.540130311","volume":"13","author":"B. K. Shoichet","year":"1992","unstructured":"Shoichet B. K., Bodian D. L., Kuntz I. D.: \u2018Molecular Docking Using Shape Descriptors\u2019, Journal of Computational Chemistry, Vol. 13, No. 3, 1992, pp. 380\u2013397.","journal-title":"Journal of Computational Chemistry"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Sproull R.F.: \u2018Refinements to Nearest Neighbor Searching in k-Dimensional Trees\u2019, Algorithmica 1991, pp. 579\u2013589.","DOI":"10.1007\/BF01759061"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0146-664X(80)80035-9","volume":"13","author":"T. Wallace","year":"1980","unstructured":"Wallace T., Wintz P.: \u2018An Efficient Three-Dimensional Aircraft Recognition Algorithm Using Normalized Fourier Descriptors\u2019, Computer Graphics and Image Processing, Vol. 13, pp. 99\u2013126, 1980.","journal-title":"Computer Graphics and Image Processing"},{"key":"28_CR24","unstructured":"Weber R., Schek H.-J., Blott S.: \u2018A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces\u2019, Proc. Int. Conf. on Very Large Databases, New York, 1998."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"White, D., Jain R.: \u2018Similarity Indexing with the SS-Tree\u2019, Proc. 12th Int. Conf. on Data Engineering, New Orleans, LA, 1996, pp. 516\u2013523.","DOI":"10.1109\/ICDE.1996.492202"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44503-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T07:40:23Z","timestamp":1550734823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}