{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:46:18Z","timestamp":1725745578409},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402845"},{"type":"electronic","value":"9783642402852"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40285-2_7","type":"book-chapter","created":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T08:02:58Z","timestamp":1376726578000},"page":"48-62","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Multi-probe LSH: An I\/O Efficient Index Structure for Approximate Nearest Neighbor Search"],"prefix":"10.1007","author":[{"given":"Shaoyi","family":"Yin","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Badr","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Vodislav","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: Lsh forest: self-tuning indexes for similarity search. In: WWW, pp. 651\u2013660 (2005)","DOI":"10.1145\/1060745.1060840"},{"issue":"9","key":"7_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"7_CR3","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-Tree: an index structure for high-dimensional data. In: Proceedings of the 22nd VLDB Conference, pp. 28\u201339 (1996)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1093\/bioinformatics\/17.5.419","volume":"17","author":"J. Buhler","year":"2001","unstructured":"Buhler, J.: Efficient large scale sequence comparison by locality-sensitive hashing. Bioinformatics\u00a017, 419\u2013428 (2001)","journal-title":"Bioinformatics"},{"key":"7_CR5","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd VLDB Conference, pp. 426\u2013435 (1997)"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-tree. ACM Computing Surveys\u00a011(2), 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Dong, W., Wang, Z., Josephson, W., Charikar, M., Li, K.: Modeling LSH for performance tuning. In: CIKM 2008, pp. 669\u2013678 (2008)","DOI":"10.1145\/1458082.1458172"},{"key":"7_CR9","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th Very Large Database (VLDB) Conference, pp. 518\u2013529 (1999)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"He, J., Liu, W., Chang, S.: Scalable similarity search with optimized kernel hashing. In: ACM SIGKDD, pp. 1129\u20131138 (2010)","DOI":"10.1145\/1835804.1835946"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. In: Proceedings of STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Jegou, H., Amsaleg, L., Schmid, C., Gros, P.: Query adaptative locality sensitive hashing. In: ICASSP 2008, pp. 825\u2013828 (2008)","DOI":"10.1109\/ICASSP.2008.4517737"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: SIGMOD Conference, pp. 369\u2013380 (1997)","DOI":"10.1145\/253262.253347"},{"key":"7_CR15","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB), Vienna, Austria, pp. 950\u2013961 (2007)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Pan, J., Manocha, D.: Bi-level locality sensitive hashing for k-Nearest Neighbor computation. In: ICDE, pp. 378\u2013389 (2012)","DOI":"10.1109\/ICDE.2012.40"},{"key":"7_CR17","unstructured":"Raginsky, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: Advances in Neural Information Processing Systems, pp. 1509\u20131517 (2009)"},{"issue":"5","key":"7_CR18","first-page":"430","volume":"5","author":"V. Satuluri","year":"2012","unstructured":"Satuluri, V., Parthasarathy, S.: Bayesian locality sensitive hashing for fast similarity search. PVLDB\u00a05(5), 430\u2013441 (2012)","journal-title":"PVLDB"},{"key":"7_CR19","unstructured":"Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, pp. 194\u2013205 (1998)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40285-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:12:58Z","timestamp":1558303978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40285-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402845","9783642402852"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40285-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}