{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:22Z","timestamp":1761611242800,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,24]],"date-time":"2009-03-24T00:00:00Z","timestamp":1237852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","award":["5005-67322"],"award-info":[{"award-number":["5005-67322"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004965","name":"Sixth Framework Programme","doi-asserted-by":"publisher","award":["FP6-027705"],"award-info":[{"award-number":["FP6-027705"]}],"id":[{"id":"10.13039\/501100004965","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,3,24]]},"DOI":"10.1145\/1516360.1516446","type":"proceedings-article","created":{"date-parts":[[2009,4,6]],"date-time":"2009-04-06T16:34:53Z","timestamp":1239035693000},"page":"744-755","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Distributed similarity search in high dimensions using locality sensitive hashing"],"prefix":"10.1145","author":[{"given":"Parisa","family":"Haghani","sequence":"first","affiliation":[{"name":"EPFL Lausanne, Switzerland"}]},{"given":"Sebastian","family":"Michel","sequence":"additional","affiliation":[{"name":"EPFL Lausanne, Switzerland"}]},{"given":"Karl","family":"Aberer","sequence":"additional","affiliation":[{"name":"EPFL Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2009,3,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132557"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00022-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497441"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031236"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98564"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276318"},{"key":"e_1_3_2_1_9_1","volume-title":"When is \"nearest neighbor\" meaningful? In ICDT","author":"Beyer Kevin S.","year":"1999","unstructured":"Kevin S. Beyer , Jonathan Goldstein , Raghu Ramakrishnan , and Uri Shaft . When is \"nearest neighbor\" meaningful? In ICDT , 1999 . Kevin S. Beyer, Jonathan Goldstein, Raghu Ramakrishnan, and Uri Shaft. When is \"nearest neighbor\" meaningful? In ICDT, 1999."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015507"},{"key":"e_1_3_2_1_11_1","first-page":"31","volume-title":"From Integrated Publication and Information Systems to Virtual Information and Knowledge Environments","author":"Buchmann Erik","year":"2005","unstructured":"Erik Buchmann and Klemens B\u00f6hm . Efficient evaluation of nearest-neighbor queries in content-addressable networks . In From Integrated Publication and Information Systems to Virtual Information and Knowledge Environments , pages 31 -- 40 , 2005 . Erik Buchmann and Klemens B\u00f6hm. Efficient evaluation of nearest-neighbor queries in content-addressable networks. In From Integrated Publication and Information Systems to Virtual Information and Knowledge Environments, pages 31--40, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.05.008"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247507"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_15_1","volume-title":"VLDB","author":"Doulkeridis Christos","year":"2007","unstructured":"Christos Doulkeridis , Akrivi Vlachou , Yannis Kotidis , and Michalis Vazirgiannis . Peer-to-peer similarity search in metric spaces . In VLDB , 2007 . Christos Doulkeridis, Akrivi Vlachou, Yannis Kotidis, and Michalis Vazirgiannis. Peer-to-peer similarity search in metric spaces. In VLDB, 2007."},{"key":"e_1_3_2_1_16_1","volume-title":"DBISP2P","author":"Falchi Fabrizio","year":"2005","unstructured":"Fabrizio Falchi , Claudio Gennaro , and Pavel Zezula . A content-addressable network for similarity search in metric spaces . In DBISP2P , 2005 . Fabrizio Falchi, Claudio Gennaro, and Pavel Zezula. A content-addressable network for similarity search in metric spaces. In DBISP2P, 2005."},{"key":"e_1_3_2_1_17_1","first-page":"518","volume-title":"VLDB","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis , Piotr Indyk , and Rajeev Motwani . Similarity search in high dimensions via hashing . In VLDB , pages 518 -- 529 , 1999 . Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518--529, 1999."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_19_1","volume-title":"WebDB","author":"Haghani Parisa","year":"2008","unstructured":"Parisa Haghani , Sebastian Michel , Philippe Cudr\u00e9-Mauroux , and Karl Aberer . LSH at large -- distributed knn search in high dimensions . In WebDB , 2008 . Parisa Haghani, Sebastian Michel, Philippe Cudr\u00e9-Mauroux, and Karl Aberer. LSH at large -- distributed knn search in high dimensions. In WebDB, 2008."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.169"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082470"},{"key":"e_1_3_2_1_23_1","volume-title":"VLDB","author":"Lv Qin","year":"2007","unstructured":"Qin Lv , William Josephson , Zhe Wang , Moses Charikar , and Kai Li. Multi-probe lsh : Efficient indexing for high-dimensional similarity search . In VLDB , 2007 . Qin Lv, William Josephson, Zhe Wang, Moses Charikar, and Kai Li. Multi-probe lsh: Efficient indexing for high-dimensional similarity search. In VLDB, 2007."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.738357"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109688"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_11"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367885"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31838-5_5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863976"},{"key":"e_1_3_2_1_32_1","volume-title":"VLDB","author":"Yu Cui","year":"2001","unstructured":"Cui Yu , Beng Chin Ooi , Kian-Lee Tan , and H. V. Jagadish . Indexing the distance: An efficient method to knn processing . In VLDB , 2001 . Cui Yu, Beng Chin Ooi, Kian-Lee Tan, and H. V. Jagadish. Indexing the distance: An efficient method to knn processing. In VLDB, 2001."},{"key":"e_1_3_2_1_33_1","volume-title":"Department of Computer Science","author":"Zhang Chi","year":"2004","unstructured":"Chi Zhang , Arvind Krishnamurthy , and Randolph Y. Wang . Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical report , Department of Computer Science , Princeton University , May 2004 . Chi Zhang, Arvind Krishnamurthy, and Randolph Y. Wang. Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical report, Department of Computer Science, Princeton University, May 2004."}],"event":{"name":"EDBT\/ICDT '09: EDBT\/ICDT '09 joint conference","acronym":"EDBT\/ICDT '09","location":"Saint Petersburg Russia"},"container-title":["Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516360.1516446","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1516360.1516446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:57Z","timestamp":1750253397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516360.1516446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,24]]},"references-count":33,"alternative-id":["10.1145\/1516360.1516446","10.1145\/1516360"],"URL":"https:\/\/doi.org\/10.1145\/1516360.1516446","relation":{},"subject":[],"published":{"date-parts":[[2009,3,24]]},"assertion":[{"value":"2009-03-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}