{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:17Z","timestamp":1779174857960,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Research Foundation, Singapore under its Strategic Capability Research Centres Funding Initiative and the National Research Foundation Singapore under its AI Singapore Programme"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389778","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"2589-2599","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring"],"prefix":"10.1145","author":[{"given":"Yifan","family":"Lei","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Huang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Kankanhalli","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony K. H.","family":"Tung","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"http:\/\/web.mit.edu\/andoni\/www\/LSH\/index.html","author":"Andoni Alexandr","year":"2005","unstructured":"Alexandr Andoni . 2005. E2 LSH 0.1 User manual. http:\/\/web.mit.edu\/andoni\/www\/LSH\/index.html ( 2005 ). Alexandr Andoni. 2005. E2LSH 0.1 User manual. http:\/\/web.mit.edu\/andoni\/www\/LSH\/index.html (2005)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Alexandr Andoni and Piotr Indyk. 2006. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS. 459--468.  Alexandr Andoni and Piotr Indyk. 2006. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS. 459--468.","DOI":"10.1109\/FOCS.2006.49"},{"key":"e_1_3_2_2_3_1","unstructured":"Alexandr Andoni Piotr Indyk Thijs Laarhoven Ilya Razenshteyn and Ludwig Schmidt. 2015. Practical and optimal LSH for angular distance. In NeurIPS. 1225--1233.  Alexandr Andoni Piotr Indyk Thijs Laarhoven Ilya Razenshteyn and Ludwig Schmidt. 2015. Practical and optimal LSH for angular distance. In NeurIPS. 1225--1233."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Alexandr Andoni and Ilya Razenshteyn. 2015. Optimal data-dependent hashing for approximate near neighbors. In STOC. 793--801.  Alexandr Andoni and Ilya Razenshteyn. 2015. Optimal data-dependent hashing for approximate near neighbors. In STOC. 793--801.","DOI":"10.1145\/2746539.2746553"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Mayank Bawa Tyson Condie and Prasanna Ganesan. 2005. LSH forest: self-tuning indexes for similarity search. In WWW. 651--660.  Mayank Bawa Tyson Condie and Prasanna Ganesan. 2005. LSH forest: self-tuning indexes for similarity search. In WWW. 651--660.","DOI":"10.1145\/1060745.1060840"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Jon Louis Bentley. 1990. K-d trees for semidynamic point sets. In SoCG. 187--197.  Jon Louis Bentley. 1990. K-d trees for semidynamic point sets. In SoCG. 187--197.","DOI":"10.1145\/98524.98564"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Alina Beygelzimer Sham Kakade and John Langford. 2006. Cover trees for nearest neighbor. In ICML. 97--104.  Alina Beygelzimer Sham Kakade and John Langford. 2006. Cover trees for nearest neighbor. In ICML. 97--104.","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_2_8_1","volume-title":"Proceedings of Compression and Complexity of Sequences. 21--29","author":"Broder Andrei Z","year":"1997","unstructured":"Andrei Z Broder . 1997 . On the resemblance and containment of documents . In Proceedings of Compression and Complexity of Sequences. 21--29 . Andrei Z Broder. 1997. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of Sequences. 21--29."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Andrei Z Broder Moses Charikar Alan M Frieze and Michael Mitzenmacher. 1998. Min-wise independent permutations. In STOC. 327--336.  Andrei Z Broder Moses Charikar Alan M Frieze and Michael Mitzenmacher. 1998. Min-wise independent permutations. In STOC. 327--336.","DOI":"10.1145\/276698.276781"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Moses S Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380--388.  Moses S Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380--388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Mayur Datar Nicole Immorlica Piotr Indyk and Vahab S Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SoCG. 253--262.  Mayur Datar Nicole Immorlica Piotr Indyk and Vahab S Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SoCG. 253--262.","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_2_12_1","volume-title":"Moses Charikar, and Kai Li.","author":"Dong Wei","year":"2008","unstructured":"Wei Dong , Zhe Wang , William Josephson , Moses Charikar, and Kai Li. 2008 . Modeling LSH for performance tuning. In CIKM. 669--678. Wei Dong, Zhe Wang, William Josephson, Moses Charikar, and Kai Li. 2008. Modeling LSH for performance tuning. In CIKM. 669--678."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Ronald Fagin Ravi Kumar and Dandapani Sivakumar. 2003. Efficient similarity search and classification via rank aggregation. In SIGMOD. 301--312.  Ronald Fagin Ravi Kumar and Dandapani Sivakumar. 2003. Efficient similarity search and classification via rank aggregation. In SIGMOD. 301--312.","DOI":"10.1145\/872757.872795"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_2_15_1","unstructured":"Junhao Gan Jianlin Feng Qiong Fang and Wilfred Ng. 2012. Localitysensitive hashing scheme based on dynamic collision counting. In SIGMOD. 541--552.  Junhao Gan Jianlin Feng Qiong Fang and Wilfred Ng. 2012. Localitysensitive hashing scheme based on dynamic collision counting. In SIGMOD. 541--552."},{"key":"e_1_3_2_2_16_1","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis , Piotr Indyk , Rajeev Motwani , 1999 . Similarity search in high dimensions via hashing . In VLDB , Vol. 99. 518 -- 529 . Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al. 1999. Similarity search in high dimensions via hashing. In VLDB, Vol. 99. 518--529.","journal-title":"VLDB"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00699107"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a014"},{"key":"e_1_3_2_2_20_1","unstructured":"Alexander Hinneburg Charu C Aggarwal and Daniel A Keim. 2000. What is the nearest neighbor in high dimensional spaces?. In VLDB. 506--515.  Alexander Hinneburg Charu C Aggarwal and Daniel A Keim. 2000. What is the nearest neighbor in high dimensional spaces?. In VLDB. 506--515."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0472-7"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC. 604--613.  Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC. 604--613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253347"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258653"},{"key":"e_1_3_2_2_28_1","unstructured":"Yifan Lei Qiang Huang Mohan Kankanhalli and Anthony Tung. 2019. Sublinear Time Nearest Neighbor Search over Generalized Weighted Space. In ICML. 3773--3781.  Yifan Lei Qiang Huang Mohan Kankanhalli and Anthony Tung. 2019. Sublinear Time Nearest Neighbor Search over Generalized Weighted Space. In ICML. 3773--3781."},{"key":"e_1_3_2_2_29_1","volume-title":"Locality-Sensitive Hashing Scheme based on Longest Circular Co- Substring. arXiv submit\/3125570","author":"Lei Yifan","year":"2020","unstructured":"Yifan Lei , Qiang Huang , Mohan Kankanhalli , and Anthony Tung . 2020. Locality-Sensitive Hashing Scheme based on Longest Circular Co- Substring. arXiv submit\/3125570 ( 2020 ). Yifan Lei, Qiang Huang, Mohan Kankanhalli, and Anthony Tung. 2020. Locality-Sensitive Hashing Scheme based on Longest Circular Co- Substring. arXiv submit\/3125570 (2020)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732947"},{"key":"e_1_3_2_2_31_1","volume-title":"ZheWang, Moses Charikar, and Kai Li.","author":"Lv Qin","year":"2007","unstructured":"Qin Lv , William Josephson , ZheWang, Moses Charikar, and Kai Li. 2007 . Multi-probe LSH: efficient indexing for high-dimensional similarity search. In VLDB. 950--961. Qin Lv, William Josephson, ZheWang, Moses Charikar, and Kai Li. 2007. Multi-probe LSH: efficient indexing for high-dimensional similarity search. In VLDB. 950--961."},{"key":"e_1_3_2_2_32_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI","author":"Malkov Yury A","year":"2018","unstructured":"Yury A Malkov and Dmitry A Yashunin . 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI ( 2018 ). Yury A Malkov and Dmitry A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI (2018)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Rina Panigrahy. 2006. Entropy based nearest neighbor search in high dimensions. In SODA. 1186--1195.  Rina Panigrahy. 2006. Entropy based nearest neighbor search in high dimensions. In SODA. 1186--1195.","DOI":"10.1145\/1109557.1109688"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Yufei Tao Ke Yi Cheng Sheng and Panos Kalnis. 2009. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD. 563--576.  Yufei Tao Ke Yi Cheng Sheng and Panos Kalnis. 2009. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD. 563--576.","DOI":"10.1145\/1559845.1559905"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2394893.2394899"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Yiqiu Wang Anshumali Shrivastava Jonathan Wang and Junghee Ryu. 2018. Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search. In SIGMOD. 889--903.  Yiqiu Wang Anshumali Shrivastava Jonathan Wang and Junghee Ryu. 2018. Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search. In SIGMOD. 889--903.","DOI":"10.1145\/3183713.3196925"},{"key":"e_1_3_2_2_39_1","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high dimensional spaces","volume":"98","author":"Schek Hans-J\u00f6rg","year":"1998","unstructured":"RogerWeber, Hans-J\u00f6rg Schek , and Stephen Blott . 1998 . A quantitative analysis and performance study for similarity-search methods in high dimensional spaces . In VLDB , Vol. 98. 194 -- 205 . RogerWeber, Hans-J\u00f6rg Schek, and Stephen Blott. 1998. A quantitative analysis and performance study for similarity-search methods in high dimensional spaces. In VLDB, Vol. 98. 194--205.","journal-title":"VLDB"},{"key":"e_1_3_2_2_40_1","volume-title":"Anthony KH Tung, and Sai Wu","author":"Zheng Yuxin","year":"2016","unstructured":"Yuxin Zheng , Qi Guo , Anthony KH Tung, and Sai Wu . 2016 . Lazylsh : Approximate nearest neighbor search for multiple distance functions with a single index. In SIGMOD. 2023--2037. Yuxin Zheng, Qi Guo, Anthony KH Tung, and Sai Wu. 2016. Lazylsh: Approximate nearest neighbor search for multiple distance functions with a single index. In SIGMOD. 2023--2037."},{"key":"e_1_3_2_2_41_1","volume-title":"Yueji Yang, and Yuxin Zheng.","author":"Zhou Jingbo","year":"2018","unstructured":"Jingbo Zhou , Qi Guo , HV Jagadish , Lubos Krcal , Siyuan Liu , Wenhao Luan , Anthony KH Tung , Yueji Yang, and Yuxin Zheng. 2018 . A generic inverted index framework for similarity search on the GPU. In ICDE. 893--904. Jingbo Zhou, Qi Guo, HV Jagadish, Lubos Krcal, Siyuan Liu, Wenhao Luan, Anthony KH Tung, Yueji Yang, and Yuxin Zheng. 2018. A generic inverted index framework for similarity search on the GPU. In ICDE. 893--904."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389778","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:20Z","timestamp":1750199900000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":41,"alternative-id":["10.1145\/3318464.3389778","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389778","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}