{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T18:45:52Z","timestamp":1761417952717,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hong Kong RGC","award":["16209519 C6030-18G C1031-18G C5026-18G AoE\/E-603\/18"],"award-info":[{"award-number":["16209519 C6030-18G C1031-18G C5026-18G AoE\/E-603\/18"]}]},{"name":"National Key Research and Development Program of China","award":["2018AAA0101100"],"award-info":[{"award-number":["2018AAA0101100"]}]},{"name":"China NSFC","award":["61729201"],"award-info":[{"award-number":["61729201"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3517880","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"917-930","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["HAP: An Efficient Hamming Space Index Based on Augmented Pigeonhole Principle"],"prefix":"10.1145","author":[{"given":"Qiyu","family":"Liu","sequence":"first","affiliation":[{"name":"HKUST, Hong Kong, Hong Kong"}]},{"given":"Yanyan","family":"Shen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"HKUST, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"volume-title":"ALENEX","author":"Boffa Antonio","key":"e_1_3_2_1_1_1","unstructured":"Antonio Boffa, Paolo Ferragina, and Giorgio Vinciguerra. 2021. A \"Learned\" Approach to Quicken and Compress Rank\/Select Dictionaries. In ALENEX. SIAM, 46--59."},{"key":"e_1_3_2_1_2_1","volume-title":"Yu","author":"Cao Zhangjie","year":"2017","unstructured":"Zhangjie Cao, Mingsheng Long, Jianmin Wang, and Philip S. Yu. 2017. HashNet: Deep Learning to Hash by Continuation. In ICCV. IEEE Computer Society, 5609--5618."},{"key":"e_1_3_2_1_3_1","volume-title":"Nicol\u00e1 s Guil, Cordelia Schmid, and Karteek Alahari.","author":"Castro Francisco M.","year":"2018","unstructured":"Francisco M. Castro, Manuel J. Mar'i n-Jim\u00e9 nez, Nicol\u00e1 s Guil, Cordelia Schmid, and Karteek Alahari. 2018. End-to-End Incremental Learning. In ECCV (12) (Lecture Notes in Computer Science, Vol. 11216). Springer, 241--257."},{"key":"e_1_3_2_1_4_1","unstructured":"Chih-Chung Chang and Chih-Jen Lin. 2021. libsvm. https:\/\/www.csie.ntu.edu.tw\/ cjlin\/libsvm\/ Retrieved 2021-05--25 from"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. ACM 380--388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056097"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856330"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425880"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_3_2_1_10_1","volume-title":"Gibbons and Yossi Matias","author":"Phillip","year":"1999","unstructured":"Phillip B. Gibbons and Yossi Matias. 1999. Synopsis Data Structures for Massive Data Sets. In SODA. ACM\/SIAM, 909--910."},{"volume-title":"Multi-Index Hashing for Information Retrieval","author":"Greene Daniel H.","key":"e_1_3_2_1_11_1","unstructured":"Daniel H. Greene, Michal Parnas, and F. Frances Yao. 1994. Multi-Index Hashing for Information Retrieval. In FOCS. IEEE Computer Society, 722--731."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384349"},{"key":"e_1_3_2_1_14_1","unstructured":"Facebook Inc. 2021. fastText. https:\/\/fasttext.cc\/ Retrieved 2021-05--25 from"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC. ACM 604--613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"volume-title":"Searching in one billion vectors: Re-rank with source coding","author":"Herv\u00e9 J\u00e9","key":"e_1_3_2_1_17_1","unstructured":"Herv\u00e9 J\u00e9 gou, Romain Tavenard, Matthijs Douze, and Laurent Amsaleg. 2011b. Searching in one billion vectors: Re-rank with source coding. In ICASSP. IEEE, 861--864."},{"key":"e_1_3_2_1_18_1","volume-title":"Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR. www.cidrdb.org.","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter A. Boncz, and Alfons Kemper. 2019. Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR. www.cidrdb.org."},{"key":"e_1_3_2_1_19_1","volume-title":"The Case for Learned Index Structures. In SIGMOD Conference. ACM, 489--504","author":"Kraska Tim","year":"2018","unstructured":"Tim Kraska, Alex Beutel, Ed H. Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. The Case for Learned Index Structures. In SIGMOD Conference. ACM, 489--504."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389752"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2015.7301269"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-019-01174-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407830"},{"key":"e_1_3_2_1_24_1","unstructured":"Gurmeet Singh Manku Arvind Jain and Anish Das Sarma. 2007. Detecting near-duplicates for web crawling. In WWW. ACM 141--150."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher. 2018. A Model for Learned Bloom Filters and Optimizing by Sandwiching. In NeurIPS. 462--471.","DOI":"10.1007\/978-1-4614-8265-9_751"},{"key":"e_1_3_2_1_26_1","volume-title":"Razvan Pascanu, KyungHyun Cho, and Yoshua Bengio.","author":"Guido","year":"2014","unstructured":"Guido F. Mont\u00fa far, Razvan Pascanu, KyungHyun Cho, and Yoshua Bengio. 2014. On the Number of Linear Regions of Deep Neural Networks. In NIPS. 2924--2932."},{"key":"e_1_3_2_1_27_1","volume-title":"Learning Multi-Dimensional Indexes. In SIGMOD Conference. ACM, 985--1000","author":"Nathan Vikram","year":"2020","unstructured":"Vikram Nathan, Jialin Ding, Mohammad Alizadeh, and Tim Kraska. 2020. Learning Multi-Dimensional Indexes. In SIGMOD Conference. ACM, 985--1000."},{"key":"e_1_3_2_1_28_1","volume-title":"Fleet","author":"Norouzi Mohammad","year":"2011","unstructured":"Mohammad Norouzi and David J. Fleet. 2011. Minimal Loss Hashing for Compact Binary Codes. In ICML. Omnipress, 353--360."},{"key":"e_1_3_2_1_29_1","volume-title":"Fleet","author":"Norouzi Mohammad","year":"2012","unstructured":"Mohammad Norouzi, Ali Punjani, and David J. Fleet. 2012. Fast search in Hamming space with multi-index hashing. In CVPR. IEEE Computer Society, 3108--3115."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.231"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358758"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Giuseppe Ottaviano and Rossano Venturini. 2014. Partitioned Elias-Fano indexes. In SIGIR. ACM 273--282.","DOI":"10.1145\/2600428.2609615"},{"key":"e_1_3_2_1_33_1","volume-title":"GPH: Similarity Search in Hamming Space","author":"Qin Jianbin","year":"2018","unstructured":"Jianbin Qin, Yaoshu Wang, Chuan Xiao, Wei Wang, Xuemin Lin, and Yoshiharu Ishikawa. 2018. GPH: Similarity Search in Hamming Space. In ICDE. IEEE Computer Society, 29--40."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2899597"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0197-0"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/331403.331405"},{"key":"e_1_3_2_1_37_1","unstructured":"sparsehash. 2021. sparsehash. https:\/\/github.com\/sparsehash\/sparsehash Retrieved 2021-05--25 from"},{"key":"e_1_3_2_1_38_1","volume-title":"Learned Cardinality Estimation for Similarity Queries. In SIGMOD Conference. ACM, 1745--1757","author":"Sun Ji","year":"2021","unstructured":"Ji Sun, Guoliang Li, and Nan Tang. 2021. Learned Cardinality Estimation for Similarity Queries. In SIGMOD Conference. ACM, 1745--1757."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"volume-title":"Approximation algorithms","author":"Vazirani Vijay V","key":"e_1_3_2_1_40_1","unstructured":"Vijay V Vazirani. 2013. Approximation algorithms .Springer Science & Business Media."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Sebastiano Vigna. 2013. Quasi-succinct indices. In WSDM. ACM 83--92.","DOI":"10.1145\/2433396.2433409"},{"volume-title":"Data driven multi-index hashing","author":"Wan Ji","key":"e_1_3_2_1_42_1","unstructured":"Ji Wan, Sheng Tang, Yongdong Zhang, Lei Huang, and Jintao Li. 2013. Data driven multi-index hashing. In ICIP. IEEE, 2670--2673."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461552"},{"key":"e_1_3_2_1_45_1","volume-title":"Monotonic Cardinality Estimation of Similarity Selection: A Deep Learning Approach. In SIGMOD Conference. ACM, 1197--1212","author":"Wang Yaoshu","year":"2020","unstructured":"Yaoshu Wang, Chuan Xiao, Jianbin Qin, Xin Cao, Yifang Sun, Wei Wang, and Makoto Onizuka. 2020. Monotonic Cardinality Estimation of Similarity Selection: A Deep Learning Approach. In SIGMOD Conference. ACM, 1197--1212."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Hao Yan Shuai Ding and Torsten Suel. 2009. Inverted index compression and query processing with optimized document ordering. In WWW. ACM 401--410.","DOI":"10.1145\/1526709.1526764"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368294"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Dan Zhang Fei Wang and Luo Si. 2011. Composite hashing with multiple information sources. In SIGIR. ACM 225--234.","DOI":"10.1145\/2009916.2009950"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Dell Zhang Jun Wang Deng Cai and Jinsong Lu. 2010. Self-taught hashing for fast similarity search. In SIGIR. ACM 18--25.","DOI":"10.1145\/1835449.1835455"},{"key":"e_1_3_2_1_50_1","first-page":"1","article-title":"HmSearch: an efficient hamming distance query processing algorithm","volume":"19","author":"Zhang Xiaoyang","year":"2013","unstructured":"Xiaoyang Zhang, Jianbin Qin, Wei Wang, Yifang Sun, and Jiaheng Lu. 2013. HmSearch: an efficient hamming distance query processing algorithm. In SSDBM. ACM, 19:1--19:12.","journal-title":"SSDBM. ACM"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517880","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3517880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:36Z","timestamp":1750188636000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":50,"alternative-id":["10.1145\/3514221.3517880","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3517880","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}