{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:56:29Z","timestamp":1775638589652,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583318","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"3225-3235","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6247-6317","authenticated-orcid":false,"given":"Patrick","family":"Chen","sequence":"first","affiliation":[{"name":"UCLA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5646-9356","authenticated-orcid":false,"given":"Wei-Cheng","family":"Chang","sequence":"additional","affiliation":[{"name":"Amazon, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1753-8099","authenticated-orcid":false,"given":"Jyun-Yu","family":"Jiang","sequence":"additional","affiliation":[{"name":"Amazon, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5235-2962","authenticated-orcid":false,"given":"Hsiang-Fu","family":"Yu","sequence":"additional","affiliation":[{"name":"Amazon, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2759-1416","authenticated-orcid":false,"given":"Inderjit","family":"Dhillon","sequence":"additional","affiliation":[{"name":"UT Austin; Google, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3520-9627","authenticated-orcid":false,"given":"Cho-Jui","family":"Hsieh","sequence":"additional","affiliation":[{"name":"UCLA;Amazon, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2019.8766229"},{"key":"e_1_3_2_1_2_1","unstructured":"Sunil Arya and David\u00a0M Mount. 1993. Approximate nearest neighbor queries in fixed dimensions.. In SODA Vol.\u00a093. Citeseer 271\u2013280."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116880"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Norbert Beckmann Hans-Peter Kriegel Ralf Schneider and Bernhard Seeger. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD. 322\u2013331.","DOI":"10.1145\/93605.98741"},{"key":"e_1_3_2_1_6_1","volume-title":"Pattern recognition. Machine learning 128, 9","author":"Bishop M","year":"2006","unstructured":"Christopher\u00a0M Bishop. 2006. Pattern recognition. Machine learning 128, 9 (2006)."},{"key":"e_1_3_2_1_7_1","volume-title":"A revisit of hashing algorithms for approximate nearest neighbor search","author":"Cai Deng","year":"2019","unstructured":"Deng Cai. 2019. A revisit of hashing algorithms for approximate nearest neighbor search. IEEE Transactions on Knowledge and Data Engineering (2019)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Moses\u00a0S Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. 380\u2013388.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_9_1","unstructured":"Patrick\u00a0H Chen Si Si Sanjiv Kumar Yang Li and Cho-Jui Hsieh. 2019. Learning to screen for fast softmax inference on large vocabulary neural networks. In ICLR."},{"key":"e_1_3_2_1_10_1","volume-title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search. NeurIPS 34","author":"Chen Qi","year":"2021","unstructured":"Qi Chen, Bing Zhao, Haidong Wang, Mingqin Li, Chuanjie Liu, Zhiyong Zheng, Mao Yang, and Jingdong Wang. 2021. SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search. NeurIPS 34 (2021)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1988.754602"},{"key":"e_1_3_2_1_12_1","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 3004\u20133012","author":"Ding Qin","year":"2019","unstructured":"Qin Ding, Hsiang-Fu Yu, and Cho-Jui Hsieh. 2019. A fast sampling algorithm for maximum inner product search. In The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 3004\u20133012."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Wei Dong Charikar Moses and Kai Li. 2011. Efficient k-nearest neighbor graph construction for generic similarity measures. In WWW. 577\u2013586.","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Matthijs Douze Alexandre Sablayrolles and Herv\u00e9 J\u00e9gou. 2018. Link and code: Fast indexing with graphs and compact regression codes. In CVPR. 3646\u20133654.","DOI":"10.1109\/CVPR.2018.00384"},{"key":"e_1_3_2_1_15_1","volume-title":"An Introduction to Johnson-Lindenstrauss Transforms. arXiv preprint arXiv:2103.00564","author":"Freksen Casper\u00a0Benjamin","year":"2021","unstructured":"Casper\u00a0Benjamin Freksen. 2021. An Introduction to Johnson-Lindenstrauss Transforms. arXiv preprint arXiv:2103.00564 (2021)."},{"key":"e_1_3_2_1_16_1","volume-title":"EFANNA: An extremely fast approximate nearest neighbor search algorithm based on knn graph. arXiv preprint arXiv:1609.07228","author":"Fu Cong","year":"2016","unstructured":"Cong Fu and Deng Cai. 2016. EFANNA: An extremely fast approximate nearest neighbor search algorithm based on knn graph. arXiv preprint arXiv:1609.07228 (2016)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3067706"},{"key":"e_1_3_2_1_18_1","volume-title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph. (July","author":"Fu Cong","year":"2017","unstructured":"Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai. 2017. Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph. (July 2017). arxiv:cs.LG\/1707.00143"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"e_1_3_2_1_20_1","unstructured":"Aristides Gionis Piotr Indyk Rajeev Motwani 1999. Similarity search in high dimensions via hashing. In VLDB Vol.\u00a099. 518\u2013529."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_22_1","unstructured":"Ruiqi Guo Philip Sun Erik Lindgren Quan Geng David Simcha Felix Chern and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In ICML. PMLR 3887\u20133896."},{"key":"e_1_3_2_1_23_1","volume-title":"Twenty-Second International Joint Conference on Artificial Intelligence.","author":"Hajebi Kiana","year":"2011","unstructured":"Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, and Hong Zhang. 2011. Fast approximate nearest-neighbor search with k-nearest neighbor graph. In Twenty-Second International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_24_1","volume-title":"FANNG: Fast approximate nearest neighbour graphs. In CVPR. 5713\u20135722.","author":"Harwood Ben","year":"2016","unstructured":"Ben Harwood and Tom Drummond. 2016. FANNG: Fast approximate nearest neighbour graphs. In CVPR. 5713\u20135722."},{"key":"e_1_3_2_1_25_1","unstructured":"Kaiming He Fang Wen and Jian Sun. 2013. K-means hashing: An affinity-preserving quantization method for learning binary compact codes. In CVPR."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC. 604\u2013613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_27_1","volume-title":"DiskANN: Fast accurate billion-point nearest neighbor search on a single node. NeurIPS 32","author":"Jayaram\u00a0Subramanya Suhas","year":"2019","unstructured":"Suhas Jayaram\u00a0Subramanya, Fnu Devvrit, Harsha\u00a0Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi. 2019. DiskANN: Fast accurate billion-point nearest neighbor search on a single node. NeurIPS 32 (2019)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2302018"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_31_1","volume-title":"Word2Bits - Quantized Word Vectors. arXiv preprint arXiv:1803.05651","author":"Lam Maximilian","year":"2018","unstructured":"Maximilian Lam. 2018. Word2Bits - Quantized Word Vectors. arXiv preprint arXiv:1803.05651 (2018)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00977785"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Conglong Li Minjia Zhang David\u00a0G Andersen and Yuxiong He. 2020. Improving approximate nearest neighbor search through learned adaptive early termination. In SIGMOD. 2539\u20132554.","DOI":"10.1145\/3318464.3380600"},{"key":"e_1_3_2_1_34_1","volume-title":"Random projections with asymmetric quantization. NeurIPS 32","author":"Li Xiaoyun","year":"2019","unstructured":"Xiaoyun Li and Ping Li. 2019. Random projections with asymmetric quantization. NeurIPS 32 (2019)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASRU.2009.5373407"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Julieta Martinez Shobhit Zakhmi Holger\u00a0H Hoos and James\u00a0J Little. 2018. LSQ++: Lower running time and higher recall in multi-codebook quantization. In ECCV.","DOI":"10.1007\/978-3-030-01270-0_30"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.3169\/mta.6.2"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Stanislav Morozov and Artem Babenko. 2019. Unsupervised neural quantization for compressed-domain similarity search. In ICCV. 3036\u20133045.","DOI":"10.1109\/ICCV.2019.00313"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.106970"},{"key":"e_1_3_2_1_41_1","volume-title":"Neural nearest neighbors networks. arXiv preprint arXiv:1810.12575","author":"Pl\u00f6tz Tobias","year":"2018","unstructured":"Tobias Pl\u00f6tz and Stefan Roth. 2018. Neural nearest neighbors networks. arXiv preprint arXiv:1810.12575 (2018)."},{"key":"e_1_3_2_1_42_1","volume-title":"Optimised KD-trees for fast image descriptor matching","author":"Silpa-Anan Chanop","unstructured":"Chanop Silpa-Anan and Richard Hartley. 2008. Optimised KD-trees for fast image descriptor matching. In CVPR. IEEE, 1\u20138."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Kohei Sugawara Hayato Kobayashi and Masajiro Iwasaki. 2016. On approximately searching for similar word embeddings. In ACL.","DOI":"10.18653\/v1\/P16-1214"},{"key":"e_1_3_2_1_44_1","volume-title":"A Note on Graph-Based Nearest Neighbor Search. arXiv preprint arXiv:2012.11083","author":"Wang Hongya","year":"2020","unstructured":"Hongya Wang, Zhizheng Wang, Wei Wang, Yingyuan Xiao, Zeng Zhao, and Kaixiang Yang. 2020. A Note on Graph-Based Nearest Neighbor Search. arXiv preprint arXiv:2012.11083 (2020)."},{"key":"e_1_3_2_1_45_1","unstructured":"Jun Wang Sanjiv Kumar and Shih-Fu Chang. 2010. Sequential projection learning for hashing with compact codes. (2010)."},{"key":"e_1_3_2_1_46_1","first-page":"5745","article-title":"Multiscale quantization for fast similarity search","volume":"30","author":"Wu Xiang","year":"2017","unstructured":"Xiang Wu, Ruiqi Guo, Ananda\u00a0Theertha Suresh, Sanjiv Kumar, Daniel\u00a0N Holtmann-Rice, David Simcha, and Felix Yu. 2017. Multiscale quantization for fast similarity search. NeurIPS 30 (2017), 5745\u20135755.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107305"},{"key":"e_1_3_2_1_48_1","volume-title":"A greedy approach for budgeted maximum inner product search. Advances in neural information processing systems 30","author":"Yu Hsiang-Fu","year":"2017","unstructured":"Hsiang-Fu Yu, Cho-Jui Hsieh, Qi Lei, and Inderjit\u00a0S Dhillon. 2017. A greedy approach for budgeted maximum inner product search. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_2_1_49_1","volume-title":"PECOS: Prediction for Enormous and Correlated Output Spaces. arXiv preprint arXiv:2010.05878","author":"Yu Hsiang-Fu","year":"2020","unstructured":"Hsiang-Fu Yu, Kai Zhong, and Inderjit\u00a0S Dhillon. 2020. PECOS: Prediction for Enormous and Correlated Output Spaces. arXiv preprint arXiv:2010.05878 (2020)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158369"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583318","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:23Z","timestamp":1750178243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":50,"alternative-id":["10.1145\/3543507.3583318","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583318","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}