{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:15Z","timestamp":1742912355218,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":21,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","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-0-387-39940-9_804","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:23:52Z","timestamp":1253089432000},"page":"1309-1314","source":"Crossref","is-referenced-by-count":0,"title":["High Dimensional Indexing"],"prefix":"10.1007","author":[{"given":"Christian","family":"B\u00f6hm","sequence":"first","affiliation":[]},{"given":"Claudia","family":"Plant","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"804_CR1_804","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., and Kriegel H.-P. The pyramid-technique: towards breaking the curse of dimensionality. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1998, pp. 142\u2013153.","DOI":"10.1145\/276305.276318"},{"key":"804_CR2_804","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Jagadish H.V., Kriegel H.-P., and Sander J. Independent quantization: an index compression technique for high-dimensional data spaces. In Proc. 16th Int. Conf. on Data Engineering, 2000, pp. 577\u2013588.","DOI":"10.1109\/ICDE.2000.839456"},{"key":"804_CR3_804","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Keim D.A., and Kriegel H.-P. A cost model for nearest neighbor search in high-dimensional data space. In Proc. 16th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1997, pp. 78\u201386.","DOI":"10.1145\/263661.263671"},{"key":"804_CR4_804","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Keim D.A., Kriegel H.-P., and Xu X. Optimal multidimensional query processing using tree striping. In Proc. 2nd Int. Conf. Data Warehousing and Knowledge Discovery, 2000, pp. 244\u2013257.","DOI":"10.1007\/3-540-44466-1_24"},{"key":"804_CR5_804","unstructured":"Berchtold S., Keim D.A., and Kriegel H.-P. The x-tree : an index structure for high-dimensional data. In Proc. 22nd Int. Conf. on Very Large Data Bases, 1996, pp. 28\u201339."},{"key":"804_CR6_804","doi-asserted-by":"crossref","unstructured":"Beyer K.S., Goldstein J., Ramakrishnan R., and Shaft U. When is \u201cnearest neighbor\u201d meaningful? In Proc. 7th Int. Conf. on Database Theory, 1999, pp. 217\u2013235.","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"2","key":"804_CR7_804","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/357775.357776","volume":"25","author":"C. B\u00f6hm","year":"2000","unstructured":"B\u00f6hm C. A cost model for query processing in high dimensional data spaces. ACM Trans. Database Syst., 25(2):129\u2013178, 2000.","journal-title":"ACM Trans. Database Syst."},{"key":"804_CR8_804","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C. and Kriegel H.-P. Dynamically optimizing high-dimensional index structures. In Advances in Database Technology, Proc. 7th Int Conf on Extending Database Technology, 2000, pp. 36\u201350.","DOI":"10.1007\/3-540-46439-5_3"},{"issue":"3","key":"804_CR9_804","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., and Keim D.A. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv., 33(3):322\u2013373, 2001.","journal-title":"ACM Comput. Surv."},{"key":"804_CR10_804","doi-asserted-by":"crossref","unstructured":"Chang Y.-C., Bergman L.D., Castelli V., Li C.-S., Lo M.-L., and Smith J.R. The onion technique: indexing for linear optimization queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2000, pp. 391\u2013402.","DOI":"10.1145\/335191.335433"},{"key":"804_CR11_804","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu H., Agrawal D., and Abbadi A.E. Concentric hyperspaces and disk allocation for fast parallel range searching. In Proc. 15th Int. Conf. on Data Engineering, 1999, pp. 608\u2013615.","DOI":"10.1109\/ICDE.1999.754977"},{"key":"804_CR12_804","doi-asserted-by":"crossref","unstructured":"Guttman A. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1984, pp. 47\u201357.","DOI":"10.1145\/971697.602266"},{"issue":"2","key":"804_CR13_804","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s11042-005-0454-4","volume":"26","author":"D.R. Heisterkamp","year":"2005","unstructured":"Heisterkamp D.R. and Peng J. Kernel vector approximation files for relevance feedback retrieval in large image databases. Multimed. Tools Appl., 26(2):175\u2013189, 2005.","journal-title":"Multimed. Tools Appl."},{"key":"804_CR14_804","doi-asserted-by":"crossref","unstructured":"Jin H., Ooi B.C., Shen H.T., Yu C., and Zhou A. An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing. In Proc. 19th Int. Conf. on Data Engineering, 2003, pp. 87\u201398.","DOI":"10.1109\/ICDE.2003.1260784"},{"key":"804_CR15_804","doi-asserted-by":"crossref","unstructured":"Katayama N. and Satoh S. The SR-tree: an index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, pp. 369\u2013380.","DOI":"10.1145\/253262.253347"},{"issue":"4","key":"804_CR16_804","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"Lin K.-I., Jagadish H.V., and Faloutsos C. The tv-tree: an index structure for high-dimensional data. VLDB J., 3(4):517\u2013542, 1994.","journal-title":"VLDB J."},{"key":"804_CR17_804","unstructured":"Sakurai Y., Yoshikawa M., Uemura S., and Kojima H. The A-tree: an index structure for high-dimensional spaces using relative approximation. In Proc. 26th Int. Conf. on Very Large Data Bases, 2000, pp. 516\u2013526."},{"key":"804_CR18_804","doi-asserted-by":"crossref","unstructured":"Weber R., B\u00f6hm K., and Schek H.-J. Interactive-time similarity search for large image collections using parallel VA-files. In Proc. 4th European Conf. Research and Advanced Tech. for Digital Libraries. Springer, 2000, pp. 83\u201392.","DOI":"10.1007\/3-540-45268-0_8"},{"key":"804_CR19_804","unstructured":"Weber R., Schek H.-J., and Blott S. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. 24th Int. Conf. on Very Large Data Bases, 1998, pp. 194\u2013205."},{"key":"804_CR20_804","doi-asserted-by":"crossref","unstructured":"White D.A. and Jain R. Similarity indexing with the ss-tree. In Proc. 12th Int. Conf. on Data Engineering, 1996, pp. 516\u2013523.","DOI":"10.1109\/ICDE.1996.492202"},{"key":"804_CR21_804","unstructured":"Yu C., Ooi B.C., Tan K.-L., and Jagadish H.V. Indexing the distance: an efficient method to KNN processing. In Proc. 27th Int. Conf. on Very Large Data Bases, 2001, pp. 421\u2013430."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:30:19Z","timestamp":1739338219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_804","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}