{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:07:08Z","timestamp":1769749628464,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,5,29]],"date-time":"2010-05-29T00:00:00Z","timestamp":1275091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s10115-010-0303-2","type":"journal-article","created":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T05:29:57Z","timestamp":1275024597000},"page":"165-192","source":"Crossref","is-referenced-by-count":10,"title":["Indexing expensive functions for efficient multi-dimensional similarity search"],"prefix":"10.1007","volume":"27","author":[{"given":"Hanxiong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutaka","family":"Furuse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuo","family":"Ohbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,29]]},"reference":[{"key":"303_CR1","unstructured":"Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of 24th international conference on very large data bases, pp 194\u2013205"},{"key":"303_CR2","unstructured":"Berchtold S, B\u00f6hm C, Keim D, Kriegel HP (1996) The X-tree: an index structure for high-dimensional data. In: Proceedings of 26th international conference on very large data bases, pp 28\u201339"},{"key":"303_CR3","doi-asserted-by":"crossref","unstructured":"Berchtold S, Ertl B, Keim DA, Kriegel HP, Seidl T (1998) Fast nearest neighbor search in high-dimensional space. In: Proceedings of the 14th international conference on data engineering, pp 209\u2013218","DOI":"10.1109\/ICDE.1998.655779"},{"key":"303_CR4","unstructured":"Berchtold S, Keim D, Kriegel HP (1998) The pyramid-technique: Toward breaking the curse of dimensional data spaces. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, pp 142\u2013153"},{"issue":"3","key":"303_CR5","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3): 322\u2013373","journal-title":"ACM Comput Surv"},{"key":"303_CR6","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu H, Tuncel E, Agrawal D, Abbadi AE (2000) Vector approximation based indexing for non-uniform high dimensional data sets. In: Proceedings of the ACM international conference on information and knowledge management, pp 202\u2013209","DOI":"10.1145\/354756.354820"},{"key":"303_CR7","doi-asserted-by":"crossref","unstructured":"Berchtold S, B\u00f6hm C, Keim D, Kriegel HP (1997) A cost model for nearest neighbor search in high-dimensional data space. In: ACM PODS symposium on principles of database systems, pp 78\u201386","DOI":"10.1145\/263661.263671"},{"issue":"3","key":"303_CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10115-004-0149-6","volume":"7","author":"J An","year":"2005","unstructured":"An J, Chen H, Furuse K, Ohbo N (2005) Cva-file: an index structure for high-dimensional datasets. Knowl Inf Syst J 7(3): 337\u2013357","journal-title":"Knowl Inf Syst J"},{"key":"303_CR9","unstructured":"Chen H, An J, Furuse K, Ohbo N (2002) C2VA:trim high dimensional indexes. In: Procedings of WAIM2002, pp 303\u2013315"},{"issue":"3","key":"303_CR10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10115-009-0226-y","volume":"21","author":"G Moise","year":"2009","unstructured":"Moise G, Zimek A, Kr\u00f6ger P, Kriegel HP, Sander J (2009) Subspace and projected clustering: experimental evaluation and analysis. Knowl Inf Syst 21(3): 299\u2013326","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"303_CR11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10115-008-0180-0","volume":"20","author":"G Song","year":"2009","unstructured":"Song G, Cui B, Zheng B, Xie K, Yang D (2009) Accelerating sequence searching: dimensionality reduction method. Knowl Inf Syst 20(3): 301\u2013322","journal-title":"Knowl Inf Syst"},{"key":"303_CR12","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Lin KI (1995) Fastmap: a fast algorithm for indexing,data mining and visualization of traditional and multimedia datasets. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data, pp 163\u2013174","DOI":"10.1145\/223784.223812"},{"key":"303_CR13","doi-asserted-by":"crossref","unstructured":"Jolliffe I (1986) In: Principal component analysis. Springer, New York, NY","DOI":"10.1007\/978-1-4757-1904-8"},{"issue":"2","key":"303_CR14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight EM (1976) A space-economical suffix tree construction algorithm. J ACM 23(2): 262\u2013 272","journal-title":"J ACM"},{"key":"303_CR15","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Hinneburg A, Keim DA (2001) On the surprising behavior of distance metrics in high dimensional spaces. In: Proceedings of the 8th international conference on database theory, pp 420\u2013434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"303_CR16","doi-asserted-by":"crossref","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful. In: Proceedings of the 7th international conference on database theory, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"303_CR17","unstructured":"Hinneburg A, Agrawal D, Keim DA (2000) What is the nearest neighbor in high dimensional spaces?. In: Proceedings of the 26th VLDB conference, pp 506\u2013515"},{"key":"303_CR18","unstructured":"Yi B, Faloutsos C (2000) Fast time sequence indexing for arbitrary L p norms. In: Proceedings of 26th international conference on very large data bases, pp 385\u2013394"},{"key":"303_CR19","doi-asserted-by":"crossref","unstructured":"Skopal T, Bustos B (2009) On index-free similarity search in metric spaces. In: DEXA, pp 516\u2013531","DOI":"10.1007\/978-3-642-03573-9_44"},{"issue":"1","key":"303_CR20","first-page":"13","volume":"2","author":"Z Zhang","year":"2009","unstructured":"Zhang Z, Ooi BC, Parthasarathy S, Tung AKH (2009) Similarity search on bregman divergence: towards non-metric indexing. PVLDB 2(1): 13\u201324","journal-title":"PVLDB"},{"key":"303_CR21","doi-asserted-by":"crossref","unstructured":"Chen H, Liu J, Furuse K, Yu JX, Ohbo N (2009) Indexing the function: an efficient algorithm for multi-dimensional search with expensive distance functions. In: ADMA, pp 67\u201378","DOI":"10.1007\/978-3-642-03348-3_10"},{"issue":"1","key":"303_CR22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10115-008-0145-3","volume":"19","author":"H Fan","year":"2009","unstructured":"Fan H, Za\u00efane OR, Foss A, Wu J (2009) Resolution-based outlier factor: detecting the top-most outlying data points in engineering data. Knowl Inf Syst 19(1): 31\u201351","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"303_CR23","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0020-0190(92)90120-K","volume":"43","author":"H Chen","year":"1992","unstructured":"Chen H, Yu X, Yamaguchi K, Kitagawa H, Ohbo N, Fujiwara Y (1992) Decomposition\u2014an approach for optimizing queries including adt functions. Inf Process Lett 43(6): 327\u2013333","journal-title":"Inf Process Lett"},{"issue":"2","key":"303_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/292481.277627","volume":"23","author":"JM Hellerstein","year":"1998","unstructured":"Hellerstein JM (1998) Optimization techniques for queries with expensive methods. ACM Trans Database Syst (TODS) 23(2): 113\u2013157","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"2","key":"303_CR25","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, Gunther O (1998) Multidimensional access methods. ACM Comput Surv (CSUR) 30(2): 170\u2013231","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2","key":"303_CR26","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. ACM Trans Database Syst (TODS) 30(2): 529\u2013576","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"9","key":"303_CR27","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1109\/TKDE.2006.148","volume":"18","author":"Y Tao","year":"2006","unstructured":"Tao Y, Yiu ML, Mamoulis N (2006) Reverse nearest neighbor search in metric spaces. IEEE Trans Knowl Data Eng 18(9): 1239\u20131252","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"303_CR28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning CD, Raghavan P, Schtze H (2008) Introduction to information retrieval. Cambridge University Press, New York"},{"key":"303_CR29","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: VLDB, pp 426\u2013435"},{"key":"303_CR30","unstructured":"Traina C Jr, Traina AJM, Seeger B, Faloutsos C (2000) Slim-trees: high performance metric trees minimizing overlap between nodes. In: EDBT, pp 51\u201365"},{"issue":"1","key":"303_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-008-0190-y","volume":"22","author":"M Zhang","year":"2010","unstructured":"Zhang M, Alhajj R (2010) Effectiveness of naq-tree as index structure for similarity search in high-dimensional metric space. Knowl Inf Syst 22(1): 1\u201326","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"303_CR32","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10115-008-0150-6","volume":"19","author":"D Pfitzner","year":"2009","unstructured":"Pfitzner D, Leibbrandt R, Powers DMW (2009) Characterization and evaluation of similarity measures for pairs of clusterings. Knowl Inf Syst 19(3): 361\u2013394","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0303-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0303-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0303-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:05:11Z","timestamp":1559131511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0303-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,29]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0303-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,29]]}}}