{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:35:24Z","timestamp":1782934524708,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,20]]},"DOI":"10.1145\/2213836.2213898","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"541-552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":182,"title":["Locality-sensitive hashing scheme based on dynamic collision counting"],"prefix":"10.1145","author":[{"given":"Junhao","family":"Gan","sequence":"first","affiliation":[{"name":"Sun Yat-Sen University, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianlin","family":"Feng","sequence":"additional","affiliation":[{"name":"Sun Yat-Sen University, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiong","family":"Fang","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98564"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872795"},{"key":"e_1_3_2_1_4_1","first-page":"518","volume-title":"VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In VLDB , pages 518 -- 529 , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518--529, 1999."},{"key":"e_1_3_2_1_5_1","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham R.","year":"1994","unstructured":"R. Graham , D. Knuth , and O. Patashnik . Concrete Mathematics: A Foundation for Computer Science . 1994 . R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. 1994."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_7_1","first-page":"13","volume-title":"Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (301)","author":"Hoeffding W.","year":"1963","unstructured":"W. Hoeffding . Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (301) , pages 13 -- 30 , 1963 . W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (301), pages 13--30, 1963."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258653"},{"key":"e_1_3_2_1_11_1","first-page":"950","volume-title":"VLDB","author":"Lv Q.","year":"2007","unstructured":"Q. Lv , W. Josephson , Z. Wang , M. Charikar , and K. Li . Multi-probe LSH: Efficient indexing for high-dimensional similarity search . In VLDB , pages 950 -- 961 , 2007 . Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-probe LSH: Efficient indexing for high-dimensional similarity search. In VLDB, pages 950--961, 2007."},{"key":"e_1_3_2_1_12_1","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"Samet H.","year":"2006","unstructured":"H. Samet . Foundations of Multidimensional and Metric Data Structures . 2006 . H. Samet. Foundations of Multidimensional and Metric Data Structures. 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806912"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989428"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767837"}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","location":"Scottsdale Arizona USA","acronym":"SIGMOD\/PODS '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213836.2213898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:01Z","timestamp":1750238461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":15,"alternative-id":["10.1145\/2213836.2213898","10.1145\/2213836"],"URL":"https:\/\/doi.org\/10.1145\/2213836.2213898","relation":{},"subject":[],"published":{"date-parts":[[2012,5,20]]},"assertion":[{"value":"2012-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}