{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T03:06:51Z","timestamp":1785208011123,"version":"3.55.0"},"reference-count":76,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T00:00:00Z","timestamp":1780012800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2322919"],"award-info":[{"award-number":["2322919"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2426031"],"award-info":[{"award-number":["2426031"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2420632"],"award-info":[{"award-number":["2420632"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2026,5,29]]},"abstract":"<jats:p>\n                    Efficient vector search is essential for powering large-scale AI applications, such as LLMs. Existing solutions are designed for monolithic architectures where compute and memory are tightly coupled. Recently, disaggregated architecture breaks this coupling by separating computation and memory resources into independently scalable pools to improve utilization. However, applying vector database to a disaggregated memory system brings unique challenges to system design due to its graph-based index. We present d-HNSW, the first RDMA-based vector search engine optimized for disaggregated memory systems. d-HNSW preserves HNSW's high accuracy while addressing the new system-level challenges introduced by disaggregation: 1) network inefficiency from pointer-chasing traversals, 2) non-contiguous remote memory layout induced by dynamic insertions, 3) redundant data transfers in batch workloads, and 4) resource underutilization due to sequential execution. d-HNSW tackles these challenges through a set of hardware-algorithm co-designed techniques, including 1) balanced clustering with a lightweight representative index to reduce network round-trips and ensure predictable latency, 2) an RDMA-friendly graph layout that preserves data contiguity under dynamic insertions, 3) query-aware data loading to eliminate redundant fetches across batch queries, and 4) a pipelined execution model that overlaps RDMA transfers with computation to hide network latency and improve throughput. Our evaluation results in a public cloud show that d-HNSW achieves up to &lt; 10\n                    <jats:sup>-2<\/jats:sup>\n                    \u00d7 query latency and &gt;100\u00d7 query throughput compared to other baselines, while maintaining a high recall of 94%.\n                  <\/jats:p>","DOI":"10.1145\/3805634","type":"journal-article","created":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T20:34:18Z","timestamp":1780086858000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3709-6749","authenticated-orcid":false,"given":"Fei","family":"Fang","sequence":"first","affiliation":[{"name":"University of California Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8839-9508","authenticated-orcid":false,"given":"Yi","family":"Liu","sequence":"additional","affiliation":[{"name":"University of California Santa Cruz, Santa Cruz, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6882-9590","authenticated-orcid":false,"given":"Chen","family":"Qian","sequence":"additional","affiliation":[{"name":"University of California Santa Cruz, Santa Cruz, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,5,29]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2023. Yandex Billion-Scale Datasets. https:\/\/research.yandex.com\/datasets\/biganns. Accessed: 2025-07--15."},{"key":"e_1_2_1_2_1","unstructured":"David Arthur and Sergei Vassilvitskii. 2006. k-means: The advantages of careful seeding. Technical Report. Stanford."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"e_1_2_1_4_1","volume-title":"SPTAG: A library for fast approximate nearest neighbor search.","author":"Chen Qi","year":"2018","unstructured":"Qi Chen, Haidong Wang, Mingqin Li, Gang Ren, Scarlett Li, Jeffery Zhu, Jason Li, Chuanjie Liu, Lintao Zhang, and Jingdong Wang. 2018. SPTAG: A library for fast approximate nearest neighbor search."},{"key":"e_1_2_1_5_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, and Jingdong Wang. 2018. SPTAG: A library for fast approximate nearest neighbor search. https:\/\/github.com\/Microsoft\/ SPTAG"},{"key":"e_1_2_1_6_1","first-page":"5199","article-title":"Spann: Highly-efficient billion-scale approximate nearest neighborhood search","volume":"34","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 neighborhood search. Advances in Neural Information Processing Systems 34 (2021), 5199--5212.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3603269.3604833"},{"key":"e_1_2_1_8_1","unstructured":"DeepSeek. [n.d.]. https:\/\/www.deepseek.com\/."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006219"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646421"},{"key":"e_1_2_1_11_1","unstructured":"Fire flyer file system. [n.d.]. https:\/\/github.com\/deepseek-ai\/3FS\/."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_2_1_13_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, et al. 1999. Similarity search in high dimensions via hashing. In Vldb, Vol. 99. 518--529.","journal-title":"Vldb"},{"key":"e_1_2_1_14_1","volume-title":"Memserve: Context caching for disaggregated llm serving with elastic memory pool. arXiv preprint arXiv:2406.17565","author":"Hu Cunchen","year":"2024","unstructured":"Cunchen Hu, Heyang Huang, Junhao Hu, Jiang Xu, Xusheng Chen, Tao Xie, Chenxi Wang, Sa Wang, Yungang Bao, Ninghui Sun, et al. 2024. Memserve: Context caching for disaggregated llm serving with elastic memory pool. arXiv preprint arXiv:2406.17565 (2024)."},{"key":"e_1_2_1_15_1","volume-title":"2023 USENIX Annual Technical Conference (USENIX ATC 23)","author":"Jang Junhyeok","year":"2023","unstructured":"Junhyeok Jang, Hanjin Choi, Hanyeoreum Bae, Seungjun Lee, Miryeong Kwon, and Myoungsoo Jung. 2023. CXLANNS: Software-Hardware collaborative memory disaggregation and computation for Billion-Scale approximate nearest neighbor search. In 2023 USENIX Annual Technical Conference (USENIX ATC 23). 585--600."},{"key":"e_1_2_1_16_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."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3749646.3749655"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607045"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3695053.3731093"},{"key":"e_1_2_1_20_1","volume-title":"Chameleon: a heterogeneous and disaggregated accelerator system for retrieval-augmented language models. arXiv preprint arXiv:2310.09949","author":"Jiang Wenqi","year":"2023","unstructured":"Wenqi Jiang, Marco Zeller, Roger Waleffe, Torsten Hoefler, and Gustavo Alonso. 2023. Chameleon: a heterogeneous and disaggregated accelerator system for retrieval-augmented language models. arXiv preprint arXiv:2310.09949 (2023)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3690624.3709194"},{"key":"e_1_2_1_22_1","volume-title":"Ragcache: Efficient knowledge caching for retrieval-augmented generation. arXiv preprint arXiv:2404.12457","author":"Jin Chao","year":"2024","unstructured":"Chao Jin, Zili Zhang, Xuanlin Jiang, Fangyue Liu, Xin Liu, Xuanzhe Liu, and Xin Jin. 2024. Ragcache: Efficient knowledge caching for retrieval-augmented generation. arXiv preprint arXiv:2404.12457 (2024)."},{"key":"e_1_2_1_23_1","unstructured":"Anuj Kalia Michael Kaminsky and David G Andersen. 2016. Design guidelines for high performance RDMA systems. In 2016 USENIX annual technical conference (USENIX ATC 16). 437--450."},{"key":"e_1_2_1_24_1","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)","author":"Kalia Anuj","year":"2016","unstructured":"Anuj Kalia, Michael Kaminsky, and David G Andersen. 2016. FaSST: Fast, scalable and simple distributed transactions with Two-Sided RDMA datagram RPCs. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16). 185--201."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles. 488--504","author":"Yu Yanpeng","year":"2021","unstructured":"Seung-seob Lee, Yanpeng Yu, Yupeng Tang, Anurag Khandelwal, Lin Zhong, and Abhishek Bhattacharjee. 2021. Mind: In-network memory management for disaggregated data centers. In Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles. 488--504."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380600"},{"key":"e_1_2_1_27_1","volume-title":"ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems. In 21st USENIX Conference on File and Storage Technologies (FAST. 99--114","author":"Li Pengfei","year":"2023","unstructured":"Pengfei Li, Yu Hua, Pengfei Zuo, Zhangyu Chen, and Jiajie Sheng. 2023. ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems. In 21st USENIX Conference on File and Storage Technologies (FAST. 99--114."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 52nd Annual International Symposium on Computer Architecture. 1093--1107","author":"Li Yiwei","year":"2025","unstructured":"Yiwei Li, Yuxin Jin, Boyu Tian, Huanchen Zhang, and Mingyu Gao. 2025. ANSMET: Approximate Nearest Neighbor Search with Near-Memory Processing and Hybrid Early Termination. In Proceedings of the 52nd Annual International Symposium on Computer Architecture. 1093--1107."},{"key":"e_1_2_1_29_1","unstructured":"A library for efficient similarity search and clustering of dense vectors. [n.d.]. https:\/\/github.com\/facebookresearch\/faiss."},{"key":"e_1_2_1_30_1","volume-title":"Retrievalattention: Accelerating long-context llm inference via vector retrieval. arXiv preprint arXiv:2409.10516","author":"Liu Di","year":"2024","unstructured":"Di Liu, Meng Chen, Baotong Lu, Huiqiang Jiang, Zhenhua Han, Qianxi Zhang, Qi Chen, Chengruidong Zhang, Bailu Ding, Kai Zhang, et al. 2024. Retrievalattention: Accelerating long-context llm inference via vector retrieval. arXiv preprint arXiv:2409.10516 (2024)."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 17th ACM Workshop on Hot Topics in Storage and File Systems. 1--8.","author":"Liu Yi","year":"2025","unstructured":"Yi Liu, Fei Fang, and Chen Qian. 2025. Efficient vector search on disaggregated memory with d-hnsw. In Proceedings of the 17th ACM Workshop on Hot Topics in Storage and File Systems. 1--8."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3705829"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3675034.3675050"},{"key":"e_1_2_1_35_1","volume-title":"SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory. In 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI 23)","author":"Luo Xuchuan","year":"2023","unstructured":"Xuchuan Luo, Pengfei Zuo, Jiacheng Shen, Jiazhen Gu, Xin Wang, Michael R Lyu, and Yangfan Zhou. 2023. SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory. In 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI 23). 553--571."},{"key":"e_1_2_1_36_1","volume-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--836."},{"key":"e_1_2_1_37_1","volume-title":"2016 USENIX Annual Technical Conference (USENIX ATC 16)","author":"Mitchell Christopher","year":"2016","unstructured":"Christopher Mitchell, Kate Montgomery, Lamont Nelson, Siddhartha Sen, and Jinyang Li. 2016. Balancing CPU and network in the cell distributed B-Tree store. In 2016 USENIX Annual Technical Conference (USENIX ATC 16). 451--464."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230557"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00864-x"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577527"},{"key":"e_1_2_1_41_1","volume-title":"The Web Is Your Oyster - Knowledge-Intensive NLP against a Very Large Web Corpus. CoRR abs\/2112.09924","author":"Piktus Aleksandra","year":"2021","unstructured":"Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Dmytro Okhonko, Samuel Broscheit, Gautier Izacard, Patrick Lewis, Barlas Oguz, Edouard Grave, Wen-tau Yih, and Sebastian Riedel. 2021. The Web Is Your Oyster - Knowledge-Intensive NLP against a Very Large Web Corpus. CoRR abs\/2112.09924 (2021). arXiv:2112.09924 https:\/\/arxiv.org\/abs\/2112.09924"},{"key":"e_1_2_1_42_1","volume-title":"Mooncake: A kvcache-centric disaggregated architecture for llm serving. arXiv preprint arXiv:2407.00079","author":"Qin Ruoyu","year":"2024","unstructured":"Ruoyu Qin, Zheming Li, Weiran He, Mingxing Zhang, Yongwei Wu, Weimin Zheng, and Xinran Xu. 2024. Mooncake: A kvcache-centric disaggregated architecture for llm serving. arXiv preprint arXiv:2407.00079 (2024)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330875"},{"key":"e_1_2_1_44_1","volume-title":"Lin (Eds.)","volume":"33","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. In Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, and H. Lin (Eds.), Vol. 33. Curran Associates, Inc., 10672--10684. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2020\/file\/788d986905533aba051261497ecffcbb-Paper.pdf"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"e_1_2_1_46_1","unstructured":"CloudLab: Flexible scientific infrastructure for research on the future of cloud computing. [n.d.]. https:\/\/www.cloudlab.us."},{"key":"e_1_2_1_47_1","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Shan Yizhou","year":"2018","unstructured":"Yizhou Shan, Yutong Huang, Yilun Chen, and Yiying Zhang. 2018. LegoOS: A disseminated, distributed OS for hardware resource disaggregation. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18). 69--87."},{"key":"e_1_2_1_48_1","volume-title":"21st USENIX Conference on File and Storage Technologies (FAST 23)","author":"Shen Jiacheng","year":"2023","unstructured":"Jiacheng Shen, Pengfei Zuo, Xuchuan Luo, Tianyi Yang, Yuxin Su, Yangfan Zhou, and Michael R Lyu. 2023. FUSEE: A fully Memory-DisaggregatedKey-Value store. In 21st USENIX Conference on File and Storage Technologies (FAST 23). 81--98."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657683"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654990"},{"key":"e_1_2_1_51_1","volume-title":"2020 USENIX Annual Technical Conference (USENIX ATC. 33--48","author":"Tsai Shin-Yeh","year":"2020","unstructured":"Shin-Yeh Tsai, Yizhou Shan, and Yiying Zhang. 2020. Disaggregating persistent memory and controlling them remotely: An exploration of passive disaggregated Key-Value stores. In 2020 USENIX Annual Technical Conference (USENIX ATC. 33--48."},{"key":"e_1_2_1_52_1","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Wang Chenxi","year":"2020","unstructured":"Chenxi Wang, Haoran Ma, Shi Liu, Yuanqi Li, Zhenyuan Ruan, Khanh Nguyen, Michael D Bond, Ravi Netravali, Miryung Kim, and Guoqing Harry Xu. 2020. Semeru: A Memory-Disaggregated managed runtime. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 261--280."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3685800.3685911"},{"key":"e_1_2_1_54_1","volume-title":"ACM Multimedia","author":"Wang Jingdong","year":"2012","unstructured":"Jingdong Wang and Shipeng Li. 2012. Query-driven iterated neighborhood graph search for large scale indexing. In ACM Multimedia 2012. 179--188."},{"key":"e_1_2_1_55_1","volume-title":"CVPR","author":"Zeng Gang","year":"2012","unstructured":"JingWang, JingdongWang, Gang Zeng, Zhuowen Tu, Rui Gan, and Shipeng Li. 2012. Scalable k-NN graph construction for visual descriptors. In CVPR 2012. 1106--1113."},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/TPAMI.2013.125","article-title":"Trinary-Projection Trees for Approximate Nearest Neighbor Search","volume":"36","author":"Jia You","year":"2014","unstructured":"JingdongWang, NaiyanWang, You Jia, Jian Li, Gang Zeng, Hongbin Zha, and Xian-Sheng Hua. 2014. Trinary-Projection Trees for Approximate Nearest Neighbor Search. IEEE Trans. Pattern Anal. Mach. Intell. 36, 2 (2014), 388--403.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 2021 International Conference on Management of Data. 2614--2627","author":"Yi Xiaomeng","year":"2021","unstructured":"JianguoWang, Xiaomeng Yi, Rentong Guo, Hai Jin, Peng Xu, Shengjun Li, XiangyuWang, Xiangzhou Guo, Chengming Li, Xiaohai Xu, et al. 2021. Milvus: A purpose-built vector data management system. In Proceedings of the 2021 International Conference on Management of Data. 2614--2627."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3555041.3589403"},{"key":"e_1_2_1_59_1","volume-title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. arXiv preprint arXiv:2101.12631","author":"Wang Mengzhao","year":"2021","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 preprint arXiv:2101.12631 (2021)."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517824"},{"key":"e_1_2_1_61_1","volume-title":"Optimizing LSM-based indexes for disaggregated memory. The VLDB Journal","author":"Wang Ruihong","year":"2024","unstructured":"Ruihong Wang, Chuqing Gao, Jianguo Wang, Prishita Kadam, M Tamer\u00d6zsu, and Walid G Aref. 2024. Optimizing LSM-based indexes for disaggregated memory. The VLDB Journal (2024), 1--24."},{"key":"e_1_2_1_62_1","volume-title":"The case for distributed shared-memory databases with rdma-enabled memory disaggregation. arXiv preprint arXiv:2207.03027","author":"Wang Ruihong","year":"2022","unstructured":"Ruihong Wang, Jianguo Wang, Stratos Idreos, M Tamer \u00d6zsu, and Walid G Aref. 2022. The case for distributed shared-memory databases with rdma-enabled memory disaggregation. arXiv preprint arXiv:2207.03027 (2022)."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00217"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3690825"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468520"},{"key":"e_1_2_1_66_1","volume-title":"Characterizing Off-path SmartNIC for Accelerating Distributed Systems. In 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI. 987--1004","author":"Wei Xingda","year":"2023","unstructured":"Xingda Wei, Rongxin Cheng, Yuhan Yang, Rong Chen, and Haibo Chen. 2023. Characterizing Off-path SmartNIC for Accelerating Distributed Systems. In 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI. 987--1004."},{"key":"e_1_2_1_67_1","volume-title":"LightTraffic: On Optimizing CPU-GPU Data Traffic for Efficient Large-scale Random Walks. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 882--895","author":"Xing Yipeng","year":"2023","unstructured":"Yipeng Xing, Yongkun Li, Zhiqiang Wang, Yinlong Xu, and John CS Lui. 2023. LightTraffic: On Optimizing CPU-GPU Data Traffic for Efficient Large-scale Random Walks. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 882--895."},{"key":"e_1_2_1_68_1","volume-title":"NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search. In 2025 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, 790--805","author":"Yuan Ziming","year":"2025","unstructured":"Ziming Yuan, Lei Dai, Wen Li, Jie Zhang, Shengwen Liang, Ying Wang, Cheng Liu, Huawei Li, Xiaowei Li, Jiafeng Guo, et al. 2025. NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search. In 2025 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, 790--805."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3613424.3614292"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357938"},{"key":"e_1_2_1_71_1","volume-title":"Motor: Enabling Multi-Versioning for Distributed Transactions on Disaggregated Memory. In 18th USENIX Symposium on Operating Systems Design and Implementation (OSDI 24)","author":"Zhang Ming","year":"2024","unstructured":"Ming Zhang, Yu Hua, and Zhijun Yang. 2024. Motor: Enabling Multi-Versioning for Distributed Transactions on Disaggregated Memory. In 18th USENIX Symposium on Operating Systems Design and Implementation (OSDI 24). 801--819."},{"key":"e_1_2_1_72_1","volume-title":"20th USENIX Conference on File and Storage Technologies (FAST 22)","author":"Zhang Ming","year":"2022","unstructured":"Ming Zhang, Yu Hua, Pengfei Zuo, and Lurong Liu. 2022. FORD: Fast one-sided RDMA-based distributed transactions for disaggregated persistent memory. In 20th USENIX Conference on File and Storage Technologies (FAST 22). 51--68."},{"key":"e_1_2_1_73_1","volume-title":"Approximate Vector Queries on Very Large Unstructured Datasets. In 20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23)","author":"Zhang Zili","year":"2023","unstructured":"Zili Zhang, Chao Jin, Linpeng Tang, Xuanzhe Liu, and Xin Jin. 2023. Fast, Approximate Vector Queries on Very Large Unstructured Datasets. In 20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23). 995--1011."},{"key":"e_1_2_1_74_1","volume-title":"Fast Vector Query Processing for Large Datasets Beyond GPU Memory with Reordered Pipelining. In 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24)","author":"Zhang Zili","year":"2024","unstructured":"Zili Zhang, Fangyue Liu, Gang Huang, Xuanzhe Liu, and Xin Jin. 2024. Fast Vector Query Processing for Large Datasets Beyond GPU Memory with Reordered Pipelining. In 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24). 23--40."},{"key":"e_1_2_1_75_1","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Zuo Pengfei","year":"2021","unstructured":"Pengfei Zuo, Jiazhao Sun, Liu Yang, Shuangwu Zhang, and Yu Hua. 2021. One-sided RDMA-Conscious extendible hashing for disaggregated memory. In 2021 USENIX Annual Technical Conference (USENIX ATC 21). 15--29."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511895"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3805634","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3805634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T20:35:14Z","timestamp":1780086914000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3805634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,29]]},"references-count":76,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,5,29]]}},"alternative-id":["10.1145\/3805634"],"URL":"https:\/\/doi.org\/10.1145\/3805634","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,29]]},"assertion":[{"value":"2026-05-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}