{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:41:21Z","timestamp":1781613681801,"version":"3.54.5"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,2]],"date-time":"2013-10-02T00:00:00Z","timestamp":1380672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Multimed Info Retr"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s13735-013-0046-4","type":"journal-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T15:02:31Z","timestamp":1380639751000},"page":"229-241","source":"Crossref","is-referenced-by-count":7,"title":["Very large scale nearest neighbor search: ideas, strategies and challenges"],"prefix":"10.1007","volume":"2","author":[{"given":"Erik","family":"Gast","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ard","family":"Oerlemans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael S.","family":"Lew","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,10,2]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Huiskes MJ, Thomee B, Lew MS (2010) New trends and ideas in visual concept detection: the MIR flickr retrieval evaluation initiative. In: MIR \u201910: Proceedings of the 2010 ACM international conference on multimedia information retrieval. ACM Press, New York, pp 527\u2013536","DOI":"10.1145\/1743384.1743475"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD \u201984: Proceedings of the 1984 ACM SIGMOD international conference on management of data, Boston, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"46_CR3","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec 19(2):322\u2013331","journal-title":"SIGMOD Rec"},{"key":"46_CR4","unstructured":"Berchtold S, Keim DA, Kriegel H.-P. (1996) The X-tree: an index structure for high-dimensional data. In: VLDB \u201996: Proceedings of the 22th international conference on very large data bases, San Francisco, pp 28\u201339"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"White DA, Jain R (1996) Similarity Indexing with the SS-tree. In: ICDE \u201996: Proceedings of the twelfth international conference on data engineering, Washington, pp 516\u2013523","DOI":"10.1109\/ICDE.1996.492202"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: SIGMOD \u201997: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, Tucson, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Ramaswamy S, Rose K (2011) Adaptive cluster distance bounding for high-dimensional indexing. IEEE Trans Knowl Data Eng 23(6):815\u2013830","DOI":"10.1109\/TKDE.2010.59"},{"key":"46_CR8","unstructured":"Henrich A, Six H-W, Widmayer P (1986) The LSD tree: spatial access to multidimensional and non-point objects. In: VLDB \u201989: Proceedings of the 15th international conference on very large data bases, Amsterdam, pp 45\u201353"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Henrich A (1998) The LSDh-Tree: an access structure for feature vectors. In: ICDE \u201998: Proceedings of the fourteenth international conference on data engineering, Washington, pp 362\u2013369","DOI":"10.1109\/ICDE.1998.655799"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti K, Mehrotra S (1999) The hybrid tree: an index structure for high dimensional feature spaces. In: ICDE \u201999: Proceedings of the 15th international conference on data engineering, Washington, pp 440\u2013447","DOI":"10.1109\/ICDE.1999.754960"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Dang TK, K\u00fcng J, Wagner R (2001) The SH-tree: a super hybrid index structure for multidimensional data. In: DEXA \u201901: Proceedings of the 12th international conference on database and expert systems applications, London, pp 340\u2013349","DOI":"10.1007\/3-540-44759-8_34"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Berchtold S, B\u00f6hm C, Kriegal H (1998) The pyramid-technique: towards breaking the curse of dimensionality. In: SIGMOD \u201998: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, Seattle, pp 142\u2013153","DOI":"10.1145\/276304.276318"},{"key":"46_CR13","unstructured":"Kamel I, Faloutsos C (1994) Hilbert R-tree: an improved R-tree using fractals. In: VLDB \u201994: Proceedings of the 20th international conference on very large data bases, San Francisco, pp 500\u2013509"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Fonseca MJ, Jorge JA (2003) Indexing high-dimensional data for content-based retrieval in large databases. In: DASFAA \u201903: Proceedings of the eighth international conference on database systems for advanced applications, Washington","DOI":"10.1109\/DASFAA.2003.1192391"},{"key":"46_CR15","unstructured":"Cu J, An Z, Guo Y, Zhou S (2010) Efficient nearest neighbor query based on extended B+-tree in high-dimensional space. Pattern Recogn Lett"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Jolliffe IT (1986) Principal component analysis. Springer, New York","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"46_CR17","unstructured":"Yu C, Ooi BC, Tan K-L, Jagadish HV (2001) Indexing the distance: an efficient method to KNN processing. In: VLDB \u201901: Proceedings of the 27th international conference on very large data bases, San Francisco, pp 421\u2013430"},{"key":"46_CR18","unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB \u201998: Proceedings of the 24rd international conference on very large data bases, San Francisco, pp 194\u2013205"},{"key":"46_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-3-642-37487-6_10","volume":"7825","author":"J Cui","year":"2013","unstructured":"Cui J, Huang Z, Wang B, Liu Y (2013) Near-optimal partial linear scan for nearest neighbor search in high-dimensional space. Lect Notes Comput Sci 7825:101\u2013115","journal-title":"Lect Notes Comput Sci"},{"issue":"6","key":"46_CR20","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.is.2005.01.001","volume":"31","author":"H Ferhatosmanoglu","year":"2006","unstructured":"Ferhatosmanoglu H, Tuncel E, Agrawal D, El Abbadi A (2006) High dimensional nearest neighbor searching. Inf Syst J 31(6):512\u2013540","journal-title":"Inf Syst J"},{"key":"46_CR21","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874668","volume-title":"Adaptive control processes\u2014a guided tour","author":"R Bellman","year":"1961","unstructured":"Bellman R (1961) Adaptive control processes\u2014a guided tour. Princeton University Press, Princeton"},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"Muja M, Lowe D (2012) Fast matching of binary features. In: Conference on computer and robot vision (CRV)","DOI":"10.1109\/CRV.2012.60"},{"key":"46_CR23","unstructured":"Macqueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, pp 281\u2013297"}],"container-title":["International Journal of Multimedia Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13735-013-0046-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13735-013-0046-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13735-013-0046-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,27]],"date-time":"2019-07-27T23:19:17Z","timestamp":1564269557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13735-013-0046-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,2]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1007\/s13735-013-0046-4","relation":{},"ISSN":["2192-6611","2192-662X"],"issn-type":[{"value":"2192-6611","type":"print"},{"value":"2192-662X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,2]]}}}