{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:41:35Z","timestamp":1725536495810},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033476"},{"type":"electronic","value":"9783642033483"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03348-3_10","type":"book-chapter","created":{"date-parts":[[2009,8,8]],"date-time":"2009-08-08T05:01:20Z","timestamp":1249707680000},"page":"67-78","source":"Crossref","is-referenced-by-count":3,"title":["Indexing the Function: An Efficient Algorithm for Multi-dimensional Search with Expensive Distance Functions"],"prefix":"10.1007","author":[{"given":"Hanxiong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jianquan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Kazutaka","family":"Furuse","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Xu Yu","sequence":"additional","affiliation":[]},{"given":"Nobuo","family":"Ohbo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D., Kriegel, H.P.: The X-tree: An index structure for high-dimensional data. In: Proceedings of 26th International Conference on Very Large Data Bases, pp. 28\u201339 (1996)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.P., Seidl, T.: Fast nearest neighbor search in high-dimensional space. In: Proceedings of the 14th International Conference on Data Engineering, pp. 209\u2013218 (1998)","DOI":"10.1109\/ICDE.1998.655779"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Keim, D., Kriegel, H.P.: The pyramid-technique: Towards breaking the curse of dimensional data spaces. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 142\u2013153 (1998)","DOI":"10.1145\/276304.276318"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: 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 (2000)","DOI":"10.1145\/354756.354820"},{"key":"10_CR6","unstructured":"Weber, R., Schek, H.J., Blott, S.: 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 (1998)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D., Kriegel, H.P.: A cost model for nearest neighbor search in high-dimensional data space. In: ACM PODS Symposium on Principles of Database Systems, pp. 78\u201386 (1997)","DOI":"10.1145\/263661.263671"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","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.: Cva-file: An index structure for high-dimensional datasets. Knowledge and Information Systems Journal\u00a07(3), 337\u2013357 (2005)","journal-title":"Knowledge and Information Systems Journal"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-45703-8_28","volume-title":"Advances in Web-Age Information Management","author":"H. Chen","year":"2002","unstructured":"Chen, H., An, J., Furuse, K., Ohbo, N.: C2VA:trim high dimensional indexes. In: Meng, X., Su, J., Wang, Y. (eds.) WAIM 2002. LNCS, vol.\u00a02419, pp. 303\u2013315. Springer, Heidelberg (2002)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-44503-X_27","volume-title":"Database Theory - ICDT 2001","author":"C. Aggarwal","year":"2000","unstructured":"Aggarwal, C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional spaces. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 420\u2013434. Springer, Heidelberg (2000)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful. In: Proceedings of the 7th Int. Conf. on Database Theory, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"10_CR12","unstructured":"Hinneburg, A., Agrawal, D., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: Proceedings of the 26th VLDB Conference, pp. 506\u2013515 (2000)"},{"key":"10_CR13","unstructured":"Yi, B., Faloutsos, C.: Fast time sequence indexing for arbitrary L p norms. In: Proceedings of 26th International Conference on Very Large Data Bases, pp. 385\u2013394 (2000)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03348-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:41:38Z","timestamp":1558478498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03348-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033476","9783642033483"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03348-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}