{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:09:22Z","timestamp":1767845362805,"version":"3.49.0"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>\n            We propose\n            <jats:italic>CXL-ANNS<\/jats:italic>\n            , a software-hardware collaborative approach to enable scalable approximate nearest neighbor search (ANNS) services. To this end, we first disaggregate DRAM from the host via compute express link (CXL) and place all essential datasets into its memory pool. While this CXL memory pool allows ANNS to handle billion-point graphs without an accuracy loss, we observe that the search performance significantly degrades because of CXL\u2019s far-memory-like characteristics. To address this, CXL-ANNS considers the node-level relationship and caches the neighbors in local memory, which are expected to visit most frequently. For the uncached nodes, CXL-ANNS prefetches a set of nodes most likely to visit soon by understanding the graph traversing behaviors of ANNS. CXL-ANNS is also aware of the architectural structures of the CXL interconnect network and lets different hardware components collaborate with each other for the search. Furthermore, it relaxes the execution dependency of neighbor search tasks and allows ANNS to utilize all hardware in the CXL network in parallel.\n          <\/jats:p>\n          <jats:p>Our evaluation shows that CXL-ANNS exhibits 93.3% lower query latency than state-of-the-art ANNS platforms that we tested. CXL-ANNS also outperforms an oracle ANNS system that has unlimited local DRAM capacity by 68.0%, in terms of latency.<\/jats:p>","DOI":"10.1145\/3639471","type":"journal-article","created":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T14:16:15Z","timestamp":1704550575000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Bridging Software-Hardware for CXL Memory Disaggregation in Billion-Scale Nearest Neighbor Search"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3053-396X","authenticated-orcid":false,"given":"Junhyeok","family":"Jang","sequence":"first","affiliation":[{"name":"KAIST, Daejeon, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3562-9410","authenticated-orcid":false,"given":"Hanjin","family":"Choi","sequence":"additional","affiliation":[{"name":"KAIST and Panmnesia, Inc., Daejeon, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0946-9986","authenticated-orcid":false,"given":"Hanyeoreum","family":"Bae","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7224-9529","authenticated-orcid":false,"given":"Seungjun","family":"Lee","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0313-1319","authenticated-orcid":false,"given":"Miryeong","family":"Kwon","sequence":"additional","affiliation":[{"name":"KAIST and Panmnesia, Inc., Daejeon, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9832-5801","authenticated-orcid":false,"given":"Myoungsoo","family":"Jung","sequence":"additional","affiliation":[{"name":"KAIST and Panmnesia, Inc., Daejeon, Korea"}]}],"member":"320","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_3_2_3_2","unstructured":"Michael J. Anderson Benny Chen Stephen Chen Summer Deng Jordan Fix Michael Gschwind Aravind Kalaiah Changkyu Kim Jaewon Lee Jason Liang Haixin Liu Yinghai Lu Jack Montgomery Arun Moorthy Nadathur Satish Sam Naghshineh Avinash Nayak Jongsoo Park Chris Petersen Martin Schatz Narayanan Sundaram Bangsheng Tang Peter Tang Amy Yang Jiecao Yu Hector Yuen Ying Zhang Aravind Anbudurai Vandana Balan Harsha Bojja Joe Boyd Matthew Breitbach Claudio Caldato Anna Calvo Garret Catron Sneh Chandwani Panos Christeas Brad Cottel Brian Coutinho Arun Dalli Abhishek Dhanotia Oniel Duncan Roman Dzhabarov Simon Elmir Chunli Fu Wenyin Fu Michael Fulthorp Adi Gangidi Nick Gibson Sean Gordon Beatriz Padilla Hernandez Daniel Ho Yu-Cheng Huang Olof Johansson Shishir Juluri Shobhit Kanaujia Manali Kesarkar Jonathan Killinger Ben Kim Rohan Kulkarni Meghan Lele Huayu Li Huamin Li Yueming Li Cynthia Liu Jerry Liu Bert Maher Chandra Mallipedi Seema Mangla Kiran Kumar Matam Jubin Mehta Shobhit Mehta Christopher Mitchell Bharath Muthiah Nitin Nagarkatte Ashwin Narasimha Bernard Nguyen Thiara Ortiz Soumya Padmanabha Deng Pan Ashwin Poojary Ye (Charlotte) Qi Olivier Raginel Dwarak Rajagopal Tristan Rice Craig Ross Nadav Rotem Scott Russ Kushal Shah Baohua Shan Hao Shen Pavan Shetty Krish Skandakumaran Kutta Srinivasan Roshan Sumbaly Michael Tauberg Mor Tzur Sidharth Verma Hao Wang Man Wang Ben Wei Alex Xia Chenyu Xu Martin Yang Kai Zhang Ruoxi Zhang Ming Zhao Whitney Zhao Rui Zhu Ajit Mathew Lin Qiao Misha Smelyanskiy Bill Jia and Vijay Rao. 2021. First-generation inference accelerator deployment at Facebook. arXiv:2107.04140. Retrieved from https:\/\/arxiv.org\/abs\/2107.04140"},{"key":"e_1_3_2_4_2","volume-title":"Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201993)","author":"Arya Sunil","year":"1993","unstructured":"Sunil Arya and David M. Mount. 1993. Approximate nearest neighbor queries in fixed dimensions. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201993)."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"e_1_3_2_7_2","article-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\u20131260.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Paul Baltescu Haoyu Chen Nikil Pancha Andrew Zhai Jure Leskovec and Charles Rosenberg. 2022. ItemSage: Learning product embeddings for shopping recommendations at pinterest. arXiv:2205.11728. Retrieved from https:\/\/arxiv.org\/abs\/2205.11728","DOI":"10.1145\/3534678.3539170"},{"key":"e_1_3_2_9_2","volume-title":"Proceedings of the First Workshop on Computer Architecture Research with RISC-V (CARRV\u201917)","author":"Celio Christopher","year":"2017","unstructured":"Christopher Celio, Pi-Feng Chiu, Borivoje Nikolic, David A. Patterson, and Krste Asanovic. 2017. BOOMv2: An open-source out-of-order RISC-V core. In Proceedings of the First Workshop on Computer Architecture Research with RISC-V (CARRV\u201917)."},{"key":"e_1_3_2_10_2","volume-title":"Proceedings of the 35th Conference on Neural Information Processing Systems (NeurIPS\u201921)","author":"Chen Qi","year":"2021","unstructured":"Qi Chen, Bing Zhao, Haidong Wang, Mingqin Li, Chuanjie Liu, Zengzhong Li, Mao Yang, and Jingdong Wang. 2021. SPANN: Highly-efficient billion-scale approximate nearest neighbor search. In Proceedings of the 35th Conference on Neural Information Processing Systems (NeurIPS\u201921)."},{"key":"e_1_3_2_11_2","volume-title":"Proceedings of the 31st ACM International Conference on Information and Knowledge Management (CIKM\u201922)","unstructured":"Rihan Chen, Bin Liu, Han Zhu, Yaoxuan Wang, Qi Li, Buting Ma, Qingbo Hua, Jun Jiang, Yunlong Xu, Hongbo Deng, and Bo Zheng. 2022. Approximate nearest neighbor search under neural similarity metric for large-scale recommendation. In Proceedings of the 31st ACM International Conference on Information and Knowledge Management (CIKM\u201922)."},{"key":"e_1_3_2_12_2","unstructured":"CXL Consortium. 2022. Compute Express Link 3.0 White Paper. Retrieved 30 January 2024 from https:\/\/www.computeexpresslink.org\/_files\/ugd\/0c1418_a8713008916044ae9604405d10a7773b.pdf"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021739"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Jeffrey Dean and Luiz Andr\u00e9 Barroso. 2013. The tail at scale. Communicationsof the ACM 56 2 (2013) 74\u201380.","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368303"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2008.4563100"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"e_1_3_2_19_2","volume-title":"Proceedings of the VLDB","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis, Piotr Indyk, and Rajeev Motwani. 1999. Similarity search in high dimensions via hashing. In Proceedings of the VLDB."},{"key":"e_1_3_2_20_2","volume-title":"Proceedings of the ACM Web Conference 2023 (WWW\u201923)","year":"2023","unstructured":"Siddharth Gollapudi, Neel Karia, Varun Sivashankar, Ravishankar Krishnaswamy, Nikit Begwani, Swapnil Raz, Yiyong Lin, Yin Zhang, Neelam Mahapatro, Premkumar Srinivasan, Amit Singh, and Harsha Vardhan Simhadri. 2023. Filtered-DiskANN: Graph algorithms for approximate nearest neighbor search with filters. In Proceedings of the ACM Web Conference 2023 (WWW\u201923)."},{"key":"e_1_3_2_21_2","first-page":"287","volume-title":"Proceedings of the 2022 USENIX Annual Technical Conference (USENIX ATC\u201922)","author":"Gouk Donghyun","year":"2022","unstructured":"Donghyun Gouk, Sangwon Lee, Miryeong Kwon, and Myoungsoo Jung. 2022. Direct access, \\(\\lbrace\\) High-Performance \\(\\rbrace\\) memory disaggregation with \\(\\lbrace\\) DirectCXL \\(\\rbrace\\) . In Proceedings of the 2022 USENIX Annual Technical Conference (USENIX ATC\u201922). 287\u2013294."},{"key":"e_1_3_2_22_2","volume-title":"Proceedings of the International Conference on Machine Learning (ICML\u201920)","author":"Guo Ruiqi","year":"2020","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 Proceedings of the International Conference on Machine Learning (ICML\u201920). Retrieved from https:\/\/arxiv.org\/abs\/1908.10396"},{"key":"e_1_3_2_23_2","first-page":"488","volume-title":"Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA\u201920)","year":"2020","unstructured":"Udit Gupta, Carole-Jean Wu, Xiaodong Wang, Maxim Naumov, Brandon Reagen, David Brooks, Bradford Cottel, Kim Hazelwood, Mark Hempstead, Bill Jia, Hsien-Hsin S. Lee, Andrey Malevich, Dheevatsa Mudigere, Mikhail Smelyanskiy, Liang Xiong, and Xuan Zhang. 2020. The architectural implications of facebook\u2019s dnn-based personalized recommendation. In Proceedings of the 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA\u201920). IEEE, 488\u2013501."},{"key":"e_1_3_2_24_2","volume-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI\u201911)","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 Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI\u201911)."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00030"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403305"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_30_2","unstructured":"Intel. 2021. Optane SSD 9 Series. Retrieved 30 January 2024 from https:\/\/www.intel.com\/content\/www\/us\/en\/products\/details\/memory-storage\/consumer-ssds\/optane-ssd-9-series.html"},{"key":"e_1_3_2_31_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS\u201919)","author":"Subramanya Suhas Jayaram","year":"2019","unstructured":"Suhas Jayaram Subramanya, Fnu Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi. 2019. DiskANN: Fast accurate billion-point nearest neighbor search on a single node. In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS\u201919). H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.). Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2019\/file\/09853c7fb1d3f8ee67a61b6bf4a7f8e6-Paper.pdf"},{"key":"e_1_3_2_32_2","unstructured":"Herve Jegou Matthijs Douze Jeff Johnson Lucas Hosseini Chengqi Deng and Alexandr Guzhva. 2018. Faiss. Retrieved 30 January 2024 from https:\/\/github.com\/facebookresearch\/faiss"},{"key":"e_1_3_2_33_2","article-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\u2013128.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00070"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2021.3097700"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/365628.365655"},{"key":"e_1_3_2_37_2","volume-title":"Proceedings of the 20th USENIX Conference on File and Storage Technologies (FAST\u201922)","author":"Kwon Miryeong","year":"2022","unstructured":"Miryeong Kwon, Donghyun Gouk, Sangwon Lee, and Myoungsoo Jung. 2022. Hardware\/software co-programmable framework for computational SSDs to accelerate deep learning service on large-scale graphs. In Proceedings of the 20th USENIX Conference on File and Storage Technologies (FAST\u201922)."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2023.3237548"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358284"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA53966.2022.00021"},{"key":"e_1_3_2_41_2","volume-title":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","unstructured":"Huaicheng Li, Daniel S. Berger, Lisa Hsu, Daniel Ernst, Pantea Zardoshti, Stanko Novakovic, Monish Shah, Samir Rajadnya, Scott Lee, Ishwar Agarwal, Mark D. Hill, Marcus Fontoura, and Ricardo Bianchini. 2023. Pond: CXL-based memory pooling systems for cloud platforms. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems."},{"key":"e_1_3_2_42_2","article-title":"Approximate nearest neighbor search on high dimensional data\u2013experiments, analyses, and improvement","author":"Li Wen","year":"2019","unstructured":"Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Mingjie Li, Wenjie Zhang, and Xuemin Lin. 2019. Approximate nearest neighbor search on high dimensional data\u2013experiments, analyses, and improvement. IEEE Transactions on Knowledge and Data Engineering 32, 8 (2019), 1475\u20131488.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_43_2","first-page":"323","volume-title":"Proceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference","unstructured":"Chieh-Jan Mike Liang, Hui Xue, Mao Yang, Lidong Zhou, Lifei Zhu, Zhao Lucis Li, Zibo Wang, Qi Chen, Quanlu Zhang, Chuanjie Liu, and Wenjun Dai. 2020. AutoSys: The design and operation of learning-augmented systems. In Proceedings of the 2020 USENIX Conference on Usenix Annual Technical Conference. 323\u2013336."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530560"},{"key":"e_1_3_2_45_2","unstructured":"Linaro. 2023. The Devicetree Specification. Retrieved 30 January 2024 from https:\/\/www.devicetree.org\/"},{"key":"e_1_3_2_46_2","volume-title":"Proceedings of the 2020 USENIX Conference on Operational Machine Learning (OpML\u201920)","author":"Liu Jiawen","year":"2020","unstructured":"Jiawen Liu, Zhen Xie, Dimitrios Nikolopoulos, and Dong Li. 2020. RIANN: Real-time incremental learning with approximate nearest neighbor on mobile devices. In Proceedings of the 2020 USENIX Conference on Operational Machine Learning (OpML\u201920)."},{"key":"e_1_3_2_47_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems (NIPS\u201904)","author":"Liu Ting","year":"2004","unstructured":"Ting Liu, Andrew Moore, Ke Yang, and Alexander Gray. 2004. An investigation of practical approximate nearest neighbor algorithms. In Proceedings of the Advances in Neural Information Processing Systems (NIPS\u201904). L. Saul, Y. Weiss, and L. Bottou (Eds.). Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2004\/file\/1102a326d5f7c9e04fc3c89d0ede88c9-Paper.pdf"},{"key":"e_1_3_2_48_2","unstructured":"Jason Lowe-Power Abdul Mutaal Ahmad Ayaz Akram Mohammad Alian Rico Amslinger Matteo Andreozzi Adri\u00e0 Armejach Nils Asmussen Srikant Bharadwaj Gabe Black Gedare Bloom Bobby R. Bruce Daniel Rodrigues Carvalho Jer\u00f3nimo Castrill\u00f3n Lizhong Chen Nicolas Derumigny Stephan Diestelhorst Wendy Elsasser Marjan Fariborz Amin Farmahini Farahani Pouya Fotouhi Ryan Gambord Jayneel Gandhi Dibakar Gope Thomas Grass Bagus Hanindhito Andreas Hansson Swapnil Haria Austin Harris Timothy Hayes Adrian Herrera Matthew Horsnell Syed Ali Raza Jafri Radhika Jagtap Hanhwi Jang Reiley Jeyapaul Timothy M. Jones Matthias Jung Subash Kannoth Hamidreza Khaleghzadeh Yuetsu Kodama Tushar Krishna Tommaso Marinelli Christian Menard Andrea Mondelli Tiago M\u00fcck Omar Naji Krishnendra Nathella Hoa Nguyen Nikos Nikoleris Lena E. Olson Marc S. Orr Binh Pham Pablo Prieto Trivikram Reddy Alec Roelke Mahyar Samani Andreas Sandberg Javier Setoain Boris Shingarov Matthew D. Sinclair Tuan Ta Rahul Thakur Giacomo Travaglini Michael Upton Nilay Vaish Ilias Vougioukas Zhengrong Wang Norbert Wehn Christian Weis David A. Wood Hongil Yoon and \u00c9der F. Zulian. 2020. The gem5 simulator: Version 20.0+. arXiv:2007.03152. Retrieved from https:\/\/arxiv.org\/abs\/2007.03152"},{"key":"e_1_3_2_49_2","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"Malkov Yu A.","year":"2018","unstructured":"Yu A. Malkov and Dmitry A. Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 42, 4 (2018), 824\u2013836.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_50_2","volume-title":"Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201922)","unstructured":"Nika Mansouri Ghiasi, Jisung Park, Harun Mustafa, Jeremie Kim, Ataberk Olgun, Arvid Gollwitzer, Damla Senol Cali, Can Firtina, Haiyu Mao, Nour Almadhoun Alserr, Rachata, Nandita Vijaykumar, Mohammed Alser, and Onur Mutlu. 2022. GenStore: A high-performance in-storage processing system for genome sequence analysis. In Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS\u201922)."},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582063"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"e_1_3_2_53_2","unstructured":"Pandu Nayak. 2019. Understanding Searches Better than Ever Before. Retrieved from https:\/\/blog.google\/products\/search\/search-language-understanding-bert\/"},{"key":"e_1_3_2_54_2","volume-title":"Proceedings of the USENIX Annual Technical Conference (ATC\u201921)","unstructured":"Joel Nider, Craig Mustard, Andrada Zoltan, John Ramsden, Larry Liu, Jacob Grossbard, Mohammad Dashti, Romaric Jodin, Alexandre Ghiti, Jordi Chauzi, and Alexandra Fedorova. 2021. A case study of processing-in-memory in off-the-shelf systems. In Proceedings of the USENIX Annual Technical Conference (ATC\u201921). 117\u2013130."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00024"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00078"},{"key":"e_1_3_2_57_2","article-title":"Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory","author":"Ren Jie","year":"2020","unstructured":"Jie Ren, Minjia Zhang, and Dong Li. 2020. Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory. Advances in Neural Information Processing Systems 33 (2020), 10672\u201310684.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_58_2","unstructured":"Harsha Simhadri. 2021. Research Talk: Approximate Nearest Neighbor Search Systems at Scale. Retrieved 30 January 2024 from https:\/\/www.youtube.com\/watch?v=BnYNdSIKibQ&list=PLD7HFcN7LXReJTWFKYqwMcCc1nZKIXBo9&index=9"},{"key":"e_1_3_2_59_2","volume-title":"Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track","unstructured":"Harsha Vardhan Simhadri, George Williams, Martin Aum\u00fcller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamny, Gopal Srinivasa, Suhas Jayaram Subramanya, and Jingdong Wang. 2022. Results of the NeurIPS\u201921 challenge on billion-scale approximate nearest neighbor search. In Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track. PMLR."},{"key":"e_1_3_2_60_2","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. Retrieved from https:\/\/arxiv.org\/abs\/2105.09613"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316548"},{"key":"e_1_3_2_63_2","unstructured":"Inc UEFI Forum. 2021. Advanced Configuration and Power Interface (ACPI) Specification Version 6.4. Retrieved 30 January 2024 from https:\/\/uefi.org\/specs\/ACPI\/6.4\/"},{"key":"e_1_3_2_64_2","unstructured":"Charlie Waldburger. 2019. As Search Needs Evolve Microsoft Makes AI Tools for Better Search Available to Researchers and Developers. Retrieved 30 January 2024 from https:\/\/news.microsoft.com\/source\/features\/ai\/bing-vector-search\/"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.125"},{"key":"e_1_3_2_66_2","volume-title":"Proceedings of the 2021 International Conference on Management of Data (SIGMOD\u201921)","unstructured":"Jianguo Wang, Xiaomeng Yi, Rentong Guo, Hai Jin, Peng Xu, Shengjun Li, Xiangyu Wang, Xiangzhou Guo, Chengming Li, Xiaohai Xu, Kun Yu, Yuxing Yuan, Yinghao Zou, Jiquan Long, Yudong Cai, Zhenxian Li, Zhifeng Zhang, Yihua Mo, Jun Gu, Ruiyi Jiang, Yi Wei, and Charles Xie. 2021. Milvus: A purpose-built vector data management system. In Proceedings of the 2021 International Conference on Management of Data (SIGMOD\u201921). 2614\u20132627."},{"key":"e_1_3_2_67_2","unstructured":"Mengzhao Wang Xiaoliang Xu Qiang Yue and Yuxiang Wang. 2021. A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. arXiv:2101.12631. Retrieved from https:\/\/arxiv.org\/abs\/2101.12631"},{"key":"e_1_3_2_68_2","volume-title":"Proceedings of the VLDB","author":"Weber Roger","year":"1998","unstructured":"Roger Weber, Hans-J\u00f6rg Schek, and Stephen Blott. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the VLDB."},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00046"},{"key":"e_1_3_2_70_2","first-page":"841","volume-title":"Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201922)","author":"Zeng Chaoliang","year":"2022","unstructured":"Chaoliang Zeng, Layong Luo, Qingsong Ning, Yaodong Han, Yuhang Jiang, Ding Tang, Zilong Wang, Kai Chen, and Chuanxiong Guo. 2022. \\(\\lbrace\\) FAERY \\(\\rbrace\\) : An \\(\\lbrace\\) FPGA-accelerated \\(\\rbrace\\) embedding-based retrieval system. In Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201922). 841\u2013856."},{"key":"e_1_3_2_71_2","volume-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD\u201922)","unstructured":"Jianjin Zhang, Zheng Liu, Weihao Han, Shitao Xiao, Ruicheng Zheng, Yingxia Shao, Hao Sun, Hanqing Zhu, Premkumar Srinivasan, Weiwei Deng, and Xing Xie. 2022. Uni-retriever: Towards learning the unified embedding based retriever in bing sponsored search. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD\u201922). 4493\u20134501."},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357938"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219820"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00094"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487665"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639471","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:53:37Z","timestamp":1750287217000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3639471"],"URL":"https:\/\/doi.org\/10.1145\/3639471","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,19]]},"assertion":[{"value":"2023-10-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-15","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}