{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:43:01Z","timestamp":1775122981949,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":74,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:00:00Z","timestamp":1698019200000},"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,10,23]]},"DOI":"10.1145\/3600006.3613166","type":"proceedings-article","created":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T14:44:17Z","timestamp":1696344257000},"page":"545-561","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["SPFresh: Incremental In-Place Update for Billion-Scale Vector Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-5784-3554","authenticated-orcid":false,"given":"Yuming","family":"Xu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China & Microsoft Research, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9771-6438","authenticated-orcid":false,"given":"Hengyu","family":"Liang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4844-2572","authenticated-orcid":false,"given":"Jin","family":"Li","sequence":"additional","affiliation":[{"name":"Harvard University, Boston, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8593-5443","authenticated-orcid":false,"given":"Shuotao","family":"Xu","sequence":"additional","affiliation":[{"name":"Microsoft Research, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7394-0185","authenticated-orcid":false,"given":"Qi","family":"Chen","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0646-5365","authenticated-orcid":false,"given":"Qianxi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7064-6120","authenticated-orcid":false,"given":"Cheng","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0491-7082","authenticated-orcid":false,"given":"Ziyue","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0378-060X","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3518-5212","authenticated-orcid":false,"given":"Yuqing","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4014-4757","authenticated-orcid":false,"given":"Peng","family":"Cheng","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6455-3898","authenticated-orcid":false,"given":"Mao","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2023,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Herv\u00e9 J\u00e9gou. Romain Tavenard. Matthijs Douze. Laurent Amsaleg. 2011. Datasets for approximate nearest neighbor search. http:\/\/corpus-texmex.irisa.fr\/.  Herv\u00e9 J\u00e9gou. Romain Tavenard. Matthijs Douze. Laurent Amsaleg. 2011. Datasets for approximate nearest neighbor search. http:\/\/corpus-texmex.irisa.fr\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Apache. [n. d.]. Apache Lucene is a high-performance full-featured text search engine library written in Java. https:\/\/github.com\/apache\/lucene.  Apache. [n. d.]. Apache Lucene is a high-performance full-featured text search engine library written in Java. https:\/\/github.com\/apache\/lucene."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204034"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_1_5_1","volume-title":"The inverted multi-index","author":"Babenko Artem","year":"2014","unstructured":"Artem Babenko and Victor Lempitsky . 2014. The inverted multi-index . IEEE transactions on pattern analysis and machine intelligence 37, 6 ( 2014 ), 1247--1260. Artem Babenko and Victor Lempitsky. 2014. The inverted multi-index. IEEE transactions on pattern analysis and machine intelligence 37, 6 (2014), 1247--1260."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.669"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1997.609451"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_11_1","unstructured":"Elasticsearch B.V. [n. d.]. Elasticsearch. https:\/\/www.elastic.co\/.  Elasticsearch B.V. [n. d.]. Elasticsearch. https:\/\/www.elastic.co\/."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/177424.177609"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Twentieth Annual Symposium on Computational Geometry","author":"Datar Mayur","unstructured":"Mayur Datar , Nicole Immorlica , Piotr Indyk , and Vahab S. Mirrokni . 2004. Locality-sensitive Hashing Scheme Based on P-stable Distributions . In Proceedings of the Twentieth Annual Symposium on Computational Geometry ( Brooklyn, New York, USA) (SCG '04). Association for Computing Machinery, New York, NY, USA, 253--262. Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. 2004. Locality-sensitive Hashing Scheme Based on P-stable Distributions. In Proceedings of the Twentieth Annual Symposium on Computational Geometry (Brooklyn, New York, USA) (SCG '04). Association for Computing Machinery, New York, NY, USA, 253--262."},{"key":"e_1_3_2_1_15_1","volume-title":"Bull. Acad. Sci. URSS 1934","author":"Delaunay B. N.","year":"1934","unstructured":"B. N. Delaunay . 1934 . Sur la sph\u00e8re vide . Bull. Acad. Sci. URSS 1934 , 6 (1934), 793--800. B. N. Delaunay. 1934. Sur la sph\u00e8re vide. Bull. Acad. Sci. URSS 1934, 6 (1934), 793--800."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_1_17_1","unstructured":"Facebook. 2020. Faiss. https:\/\/github.com\/facebookresearch\/faiss.  Facebook. 2020. Faiss. https:\/\/github.com\/facebookresearch\/faiss."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_1_20_1","volume-title":"A new statistical approach to geographic variation analysis. Systematic zoology 18, 3","author":"Ruben Gabriel K","year":"1969","unstructured":"K Ruben Gabriel and Robert R Sokal . 1969. A new statistical approach to geographic variation analysis. Systematic zoology 18, 3 ( 1969 ), 259--278. K Ruben Gabriel and Robert R Sokal. 1969. A new statistical approach to geographic variation analysis. Systematic zoology 18, 3 (1969), 259--278."},{"key":"e_1_3_2_1_21_1","unstructured":"Google. [n. d.]. Youtube. https:\/\/blog.youtube\/press\/.  Google. [n. d.]. Youtube. https:\/\/blog.youtube\/press\/."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554843"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-222"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"e_1_3_2_1_25_1","unstructured":"Intel. [n. d.]. SPDK: Storage Performance Development Kit. https:\/\/spdk.io\/.  Intel. [n. d.]. SPDK: Storage Performance Development Kit. https:\/\/spdk.io\/."},{"key":"e_1_3_2_1_26_1","volume-title":"International Conference on Similarity Search and Applications. Springer, Springer International Publishing, Cham, 20--33","author":"Iwasaki Masajiro","year":"2016","unstructured":"Masajiro Iwasaki . 2016 . Pruned bi-directed k-nearest neighbor graph for proximity search . In International Conference on Similarity Search and Applications. Springer, Springer International Publishing, Cham, 20--33 . Masajiro Iwasaki. 2016. Pruned bi-directed k-nearest neighbor graph for proximity search. In International Conference on Similarity Search and Applications. Springer, Springer International Publishing, Cham, 20--33."},{"key":"e_1_3_2_1_27_1","unstructured":"Masajiro Iwasaki and Daisuke Miyazaki. 2018. Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data. arXiv:1810.07355 [cs.DB]  Masajiro Iwasaki and Daisuke Miyazaki. 2018. Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data. arXiv:1810.07355 [cs.DB]"},{"key":"e_1_3_2_1_28_1","volume-title":"2008 IEEE Conference on Computer Vision and Pattern Recognition. 1--8.","author":"Jain P.","unstructured":"P. Jain , B. Kulis , and K. Grauman . 2008. Fast image search for learned metrics . In 2008 IEEE Conference on Computer Vision and Pattern Recognition. 1--8. P. Jain, B. Kulis, and K. Grauman. 2008. Fast image search for learned metrics. In 2008 IEEE Conference on Computer Vision and Pattern Recognition. 1--8."},{"key":"e_1_3_2_1_29_1","volume-title":"Product quantization for nearest neighbor search","author":"Jegou Herve","year":"2010","unstructured":"Herve Jegou , Matthijs Douze , and Cordelia Schmid . 2010. Product quantization for nearest neighbor search . IEEE transactions on pattern analysis and machine intelligence 33, 1 ( 2010 ), 117--128. Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence 33, 1 (2010), 117--128."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00042"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola , Guy Blelloch , and Carlos Guestrin . 2012 . GraphChi: Large-Scale Graph Computation on Just a PC . In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation ( Hollywood, CA, USA) (OSDI'12). USENIX Association, USA, 31--46. Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012. GraphChi: Large-Scale Graph Computation on Just a PC. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (Hollywood, CA, USA) (OSDI'12). USENIX Association, USA, 31--46."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284028.3284030"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467101"},{"key":"e_1_3_2_1_36_1","volume-title":"An investigation of practical approximate nearest neighbor algorithms. Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, {NIPS}","author":"Liu Ting","year":"2004","unstructured":"Ting Liu , Andrew W Moore , Alexander Gray , and Ke Yang . 2004. An investigation of practical approximate nearest neighbor algorithms. Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, {NIPS} 2004 , December 13--18, 2004, Vancouver, British Columbia, Canada ] (2004), 825--832. http:\/\/papers.nips.cc\/paper\/2666-an-investigation-of-practical-approximate-nearest-neighbor-algorithms Ting Liu, Andrew W Moore, Alexander Gray, and Ke Yang. 2004. An investigation of practical approximate nearest neighbor algorithms. Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, {NIPS} 2004, December 13--18, 2004, Vancouver, British Columbia, Canada] (2004), 825--832. http:\/\/papers.nips.cc\/paper\/2666-an-investigation-of-practical-approximate-nearest-neighbor-algorithms"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/3042573.3042779"},{"key":"e_1_3_2_1_40_1","unstructured":"microsoft. 2020. SPACEV1B: A billion-Scale vector dataset for text descriptors. https:\/\/github.com\/microsoft\/SPTAG\/tree\/master\/datasets\/SPACEV1B.  microsoft. 2020. SPACEV1B: A billion-Scale vector dataset for text descriptors. https:\/\/github.com\/microsoft\/SPTAG\/tree\/master\/datasets\/SPACEV1B."},{"key":"e_1_3_2_1_41_1","unstructured":"microsoft. 2023. lsv3-series. https:\/\/learn.microsoft.com\/en-us\/azure\/virtual-machines\/lsv3-series.  microsoft. 2023. lsv3-series. https:\/\/learn.microsoft.com\/en-us\/azure\/virtual-machines\/lsv3-series."},{"key":"e_1_3_2_1_42_1","unstructured":"Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient Estimation of Word Representations in Vector Space. arXiv:1301.3781 [cs.CL]  Tomas Mikolov Kai Chen Greg Corrado and Jeffrey Dean. 2013. Efficient Estimation of Word Representations in Vector Space. arXiv:1301.3781 [cs.CL]"},{"key":"e_1_3_2_1_43_1","volume-title":"The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In {UAI} '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence","author":"Moore Andrew W","year":"2000","unstructured":"Andrew W Moore . 2000. The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In {UAI} '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence , Stanford University, Stanford, California, USA , June 30 - July 3, 2000 , Vol. I . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 397--405. https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1{&}smnu=2{&}article{_}id=47{&}proceeding{_}id=16 Andrew W Moore. 2000. The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In {UAI} '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30 - July 3, 2000, Vol. I. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 397--405. https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1{&}smnu=2{&}article{_}id=47{&}proceeding{_}id=16"},{"key":"e_1_3_2_1_44_1","volume-title":"Non-Metric Locality-Sensitive Hashing","author":"Mu Yadong","unstructured":"Yadong Mu and Shuicheng Yan . 2010. Non-Metric Locality-Sensitive Hashing .. In AAAI. AAAI Press , 539--544. Yadong Mu and Shuicheng Yan. 2010. Non-Metric Locality-Sensitive Hashing.. In AAAI. AAAI Press, 539--544."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"e_1_3_2_1_47_1","unstructured":"OpenAI. 2022. ChatGPT Retrieval Plugin. https:\/\/github.com\/openai\/chatgpt-retrieval-plugin.  OpenAI. 2022. ChatGPT Retrieval Plugin. https:\/\/github.com\/openai\/chatgpt-retrieval-plugin."},{"key":"e_1_3_2_1_48_1","unstructured":"OpenAI. 2022. GPT3 Embedding. https:\/\/platform.openai.com\/docs\/guides\/embeddings.  OpenAI. 2022. GPT3 Embedding. https:\/\/platform.openai.com\/docs\/guides\/embeddings."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"e_1_3_2_1_50_1","volume-title":"Advances in neural information processing systems","author":"Raginsky Maxim","unstructured":"Maxim Raginsky and Svetlana Lazebnik . 2009. Locality-sensitive binary codes from shift-invariant kernels . In Advances in neural information processing systems . Curran Associates Inc., Red Hook, NY, USA , 1509--1517. Maxim Raginsky and Svetlana Lazebnik. 2009. Locality-sensitive binary codes from shift-invariant kernels. In Advances in neural information processing systems. Curran Associates Inc., Red Hook, NY, USA, 1509--1517."},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"Ren Jie","year":"2020","unstructured":"Jie Ren , Minjia Zhang , and Dong Li . 2020 . HM-ANN: Efficient BillionPoint Nearest Neighbor Search on Heterogeneous Memory . In Proceedings of the 34th International Conference on Neural Information Processing Systems ( Vancouver, BC, Canada) (NIPS'20). Curran Associates Inc., Red Hook, NY, USA, Article 895, 13 pages. Jie Ren, Minjia Zhang, and Dong Li. 2020. HM-ANN: Efficient BillionPoint Nearest Neighbor Search on Heterogeneous Memory. In Proceedings of the 34th International Conference on Neural Information Processing Systems (Vancouver, BC, Canada) (NIPS'20). Curran Associates Inc., Red Hook, NY, USA, Article 895, 13 pages."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_53_1","volume-title":"Ravishankar Krishnaswamy, and Harsha Vardhan Simhadri.","author":"Singh Aditi","year":"2021","unstructured":"Aditi Singh , Suhas Jayaram Subramanya , Ravishankar Krishnaswamy, and Harsha Vardhan Simhadri. 2021 . FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search . arXiv:2105.09613 [cs.IR] Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy, and Harsha Vardhan Simhadri. 2021. FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search. arXiv:2105.09613 [cs.IR]"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2072298.2072354"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"e_1_3_2_1_56_1","volume-title":"DiskANN: Fast Accurate Billion-Point Nearest Neighbor Search on a Single Node","author":"Subramanya Suhas Jayaram","unstructured":"Suhas Jayaram Subramanya , Devvrit, Rohan Kadekodi , Ravishankar Krishaswamy , and Harsha Vardhan Simhadri . 2019. DiskANN: Fast Accurate Billion-Point Nearest Neighbor Search on a Single Node . Curran Associates Inc., Red Hook, NY, USA. Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishaswamy, and Harsha Vardhan Simhadri. 2019. DiskANN: Fast Accurate Billion-Point Nearest Neighbor Search on a Single Node. Curran Associates Inc., Red Hook, NY, USA."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15286-3_16"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556574"},{"key":"e_1_3_2_1_60_1","volume-title":"The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4","author":"Toussaint Godfried T","year":"1980","unstructured":"Godfried T Toussaint . 1980. The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4 ( 1980 ), 261--268. Godfried T Toussaint. 1980. The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4 (1980), 261--268."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2393378"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.125"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"e_1_3_2_1_67_1","volume-title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search. In 35th Conference on Neural Information Processing Systems (NeurIPS","author":"Chen Qi","year":"2021","unstructured":"Qi Chen . Bing Zhao . Haidong Wang . Mingqin Li. Chuanjie Liu . Zengzhong Li. Mao Yang . Jingdong Wang . 2021 . SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search. In 35th Conference on Neural Information Processing Systems (NeurIPS 2021). Qi Chen. Bing Zhao. Haidong Wang. Mingqin Li. Chuanjie Liu. Zengzhong Li. Mao Yang. Jingdong Wang. 2021. SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search. In 35th Conference on Neural Information Processing Systems (NeurIPS 2021)."},{"key":"e_1_3_2_1_68_1","volume-title":"SPTAG: A library for fast approximate nearest neighbor search. https:\/\/github.com\/Microsoft\/SPTAG.","author":"Chen Qi","year":"2018","unstructured":"Qi Chen . Haidong Wang . Mingqin Li. Gang Ren . Scarlett Li. Jeffery Zhu . Jason Li. Chuanjie Liu . Lintao Zhang . Jingdong Wang . 2018 . SPTAG: A library for fast approximate nearest neighbor search. https:\/\/github.com\/Microsoft\/SPTAG. Qi Chen. Haidong Wang. Mingqin Li. Gang Ren. Scarlett Li. Jeffery Zhu. Jason Li. Chuanjie Liu. Lintao Zhang. Jingdong Wang. 2018. SPTAG: A library for fast approximate nearest neighbor search. https:\/\/github.com\/Microsoft\/SPTAG."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"e_1_3_2_1_70_1","volume-title":"Advances in neural information processing systems","author":"Weiss Yair","unstructured":"Yair Weiss , Antonio Torralba , and Rob Fergus . 2009. Spectral hashing . In Advances in neural information processing systems . Curran Associates Inc., Red Hook, NY, USA , 1753--1760. Yair Weiss, Antonio Torralba, and Rob Fergus. 2009. Spectral hashing. In Advances in neural information processing systems. Curran Associates Inc., Red Hook, NY, USA, 1753--1760."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126424"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313789"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357938"},{"key":"e_1_3_2_1_74_1","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies","author":"Zheng Da","unstructured":"Da Zheng , Disa Mhembere , Randal Burns , Joshua Vogelstein , Carey E. Priebe , and Alexander S. Szalay . 2015. FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs . In Proceedings of the 13th USENIX Conference on File and Storage Technologies ( Santa Clara, CA) (FAST'15). USENIX Association, USA, 45--58. Da Zheng, Disa Mhembere, Randal Burns, Joshua Vogelstein, Carey E. Priebe, and Alexander S. Szalay. 2015. FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs. In Proceedings of the 13th USENIX Conference on File and Storage Technologies (Santa Clara, CA) (FAST'15). USENIX Association, USA, 45--58."}],"event":{"name":"SOSP '23: 29th Symposium on Operating Systems Principles","location":"Koblenz Germany","acronym":"SOSP '23","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","USENIX"]},"container-title":["Proceedings of the 29th Symposium on Operating Systems Principles"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3600006.3613166","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:49Z","timestamp":1750178209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3600006.3613166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,23]]},"references-count":74,"alternative-id":["10.1145\/3600006.3613166","10.1145\/3600006"],"URL":"https:\/\/doi.org\/10.1145\/3600006.3613166","relation":{},"subject":[],"published":{"date-parts":[[2023,10,23]]},"assertion":[{"value":"2023-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}