{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T20:02:49Z","timestamp":1779825769876,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","funder":[{"name":"Hong Kong RGC Grant","award":["12202024"],"award-info":[{"award-number":["12202024"]}]},{"name":"Hong Kong RGC Grant","award":["12201925"],"award-info":[{"award-number":["12201925"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,5,31]]},"DOI":"10.1145\/3788853.3801879","type":"proceedings-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T19:14:47Z","timestamp":1779822887000},"page":"580-587","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Vector Search for the Future: From Memory-Resident, Static Heterogeneous Storage, to Cloud-Native Architectures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4220-0145","authenticated-orcid":false,"given":"Yitong","family":"Song","sequence":"first","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2285-7836","authenticated-orcid":false,"given":"Xuanhe","family":"Zhou","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9697-7670","authenticated-orcid":false,"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[{"name":"Aalborg University, Aalborg, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9404-5848","authenticated-orcid":false,"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Meta AI. 2017. FAISS. https:\/\/ai.facebook.com\/tools\/faiss."},{"key":"e_1_3_2_1_2_1","first-page":"12","article-title":"Cache locality is not enough: High-performance nearest neighbor search with product quantization fast scan","volume":"9","author":"Andr\u00e9 Fabien","year":"2016","unstructured":"Fabien Andr\u00e9, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2016. Cache locality is not enough: High-performance nearest neighbor search with product quantization fast scan. VLDB, Vol. 9, 4 (2016), 12.","journal-title":"VLDB"},{"key":"e_1_3_2_1_3_1","first-page":"931","article-title":"Additive quantization for extreme vector compression","author":"Babenko Artem","year":"2014","unstructured":"Artem Babenko and Victor Lempitsky. 2014a. Additive quantization for extreme vector compression. In CVPR. 931-938.","journal-title":"CVPR."},{"key":"e_1_3_2_1_4_1","first-page":"1247","volume-title":"IEEE TPAMI","volume":"37","author":"Babenko Artem","year":"2014","unstructured":"Artem Babenko and Victor Lempitsky. 2014b. The inverted multi-index. IEEE TPAMI, Vol. 37, 6 (2014), 1247-1260."},{"key":"e_1_3_2_1_5_1","volume-title":"Annoy: Approximate Nearest Neighbors Oh Yeah. https:\/\/github.com\/spotify\/annoy. Accessed: 2025-01-21.","author":"Bernhardsson Erik","year":"2013","unstructured":"Erik Bernhardsson. 2013. Annoy: Approximate Nearest Neighbors Oh Yeah. https:\/\/github.com\/spotify\/annoy. Accessed: 2025-01-21."},{"key":"e_1_3_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. NeurIPS, Vol. 34, 5199-5212.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_7_1","first-page":"3198","article-title":"New trends in high-d vector similarity search: al-driven, progressive, and distributed","volume":"14","author":"Echihabi Karima","year":"2021","unstructured":"Karima Echihabi, Kostas Zoumpatianos, and Themis Palpanas. 2021. New trends in high-d vector similarity search: al-driven, progressive, and distributed. PVLDB, Vol. 14, 12 (2021), 3198-3201.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2024-0035"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654970"},{"key":"e_1_3_2_1_11_1","unstructured":"Pengfei Gao Zhao Tian Xiangxin Meng Xinchen Wang Ruida Hu Yuanan Xiao Yizhou Liu Zhao Zhang Junjie Chen Cuiyun Gao et al. 2025. Trae agent: An llm-based agent for software engineering with test-time scaling. arXiv preprint arXiv:2507.23370 (2025)."},{"key":"e_1_3_2_1_12_1","first-page":"2946","article-title":"Optimized product quantization for approximate nearest neighbor search","author":"Ge Tiezheng","year":"2013","unstructured":"Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2013. Optimized product quantization for approximate nearest neighbor search. In IEEE TPAMI. 2946-2953.","journal-title":"IEEE TPAMI."},{"key":"e_1_3_2_1_13_1","first-page":"3406","article-title":"Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters","author":"Gollapudi Siddharth","year":"2023","unstructured":"Siddharth Gollapudi, Neel Karia, Varun Sivashankar, Ravishankar Krishnaswamy, Nikit Begwani, Swapnil Raz, Yiyong Lin, Yin Zhang, Neelam Mahapatro, Premkumar Srinivasan, et al., 2023. Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters. In WWW. 3406-3416.","journal-title":"WWW."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397243"},{"key":"e_1_3_2_1_15_1","first-page":"171","volume-title":"19th USENIX Symposium on Operating Systems Design and Implementation (OSDI 25)","author":"Guo Hao","year":"2025","unstructured":"Hao Guo and Youyou Lu. 2025. Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD. 19th USENIX Symposium on Operating Systems Design and Implementation (OSDI 25) (2025), 171-186."},{"key":"e_1_3_2_1_16_1","volume-title":"Accelerating large-scale inference with anisotropic vector quantization. ICML","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. ICML (2020), 3887-3896."},{"key":"e_1_3_2_1_17_1","unstructured":"Cal Huang. 2025. Migrating from S3 Vectors to Zilliz Cloud: Unlocking the Power of Tiered Storage. https:\/\/zilliz.com\/blog\/migrating-from-s3-vectors-to-zilliz-cloud-unlocking-the-power-of-tiered-storage Blog post Zilliz."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"e_1_3_2_1_19_1","unstructured":"Turbopuffer Inc. 2025. Turbopuffer \u2014 Serverless Vector & Full-Text Search Built from First Principles on Object Storage. https:\/\/turbopuffer.com\/ Company website \/ product page."},{"key":"e_1_3_2_1_20_1","volume-title":"Ravishankar Krishnawamy, and Rohan Kadekodi.","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. NeurIPS, Vol. 32 (2019)."},{"key":"e_1_3_2_1_21_1","first-page":"117","volume-title":"IEEE TPAMI","volume":"33","author":"Jegou Herve","year":"2010","unstructured":"Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010. Product quantization for nearest neighbor search. IEEE TPAMI, Vol. 33, 1 (2010), 117-128."},{"key":"e_1_3_2_1_22_1","volume-title":"Scalable Disk-Based Approximate Nearest Neighbor Search with Page-Aligned Graph. arXiv preprint arXiv:2509.25487","author":"Kang Dingyi","year":"2025","unstructured":"Dingyi Kang, Dongming Jiang, Hanshen Yang, Hang Liu, and Bingzhe Li. 2025. Scalable Disk-Based Approximate Nearest Neighbor Search with Page-Aligned Graph. arXiv preprint arXiv:2509.25487 (2025)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.764879"},{"key":"e_1_3_2_1_24_1","volume-title":"BAMG: A Block-Aware Monotonic Graph Index for Disk-Based Approximate Nearest Neighbor Search. arXiv preprint arXiv:2509.03226","author":"Li Huiling","year":"2025","unstructured":"Huiling Li and Jianliang Xu. 2025. BAMG: A Block-Aware Monotonic Graph Index for Disk-Based Approximate Nearest Neighbor Search. arXiv preprint arXiv:2509.03226 (2025)."},{"key":"e_1_3_2_1_25_1","first-page":"1333","article-title":"A general and efficient querying method for learning to hash","author":"Li Jinfeng","year":"2018","unstructured":"Jinfeng Li, Xiao Yan, Jian Zhang, An Xu, James Cheng, Jie Liu, Kelvin KW Ng, and Ti-chung Cheng. 2018. A general and efficient querying method for learning to hash. In ACM SIGMOD. 1333-1347.","journal-title":"ACM SIGMOD."},{"key":"e_1_3_2_1_26_1","volume-title":"289-300","author":"Li Mingjie","year":"2020","unstructured":"Mingjie Li, Ying Zhang, Yifang Sun, Wei Wang, Ivor W Tsang, and Xuemin Lin. 2020. I\/O efficient approximate nearest neighbour search based on learned functions. IEEE ICDE (2020), 289-300."},{"key":"e_1_3_2_1_27_1","first-page":"1475","article-title":"Approximate nearest neighbor search on high dimensional data\u2014experiments, analyses, and improvement","volume":"32","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\u2014experiments, analyses, and improvement. IEEE TKDE, Vol. 32, 8 (2019), 1475-1488.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_28_1","volume-title":"Cloud-Native Vector Search: A Comprehensive Performance Analysis. arXiv preprint arXiv:2511.14748","author":"Li Zhaoheng","year":"2025","unstructured":"Zhaoheng Li, Wei Ding, Silu Huang, Zikang Wang, Yuanjin Lin, Ke Wu, Yongjoo Park, and Jianjun Chen. 2025. Cloud-Native Vector Search: A Comprehensive Performance Analysis. arXiv preprint arXiv:2511.14748 (2025)."},{"key":"e_1_3_2_1_29_1","volume-title":"UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search. PVLDB","author":"Liang Anqi","year":"2025","unstructured":"Anqi Liang, Pengcheng Zhang, Bin Yao, Zhongpu Chen, Yitong Song, and Guangxu Cheng. 2025. UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search. PVLDB (2025)."},{"key":"e_1_3_2_1_30_1","volume-title":"Fast Clustering with Flexible Balance Constraints. In 2018 IEEE International Conference on Big Data (Big Data).","author":"Liu Hongfu","year":"2018","unstructured":"Hongfu Liu, Ziming Huang, Qi Chen, Mingqin Li, Y. Fu, and Lintao Zhang. 2018. Fast Clustering with Flexible Balance Constraints. In 2018 IEEE International Conference on Big Data (Big Data)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00169"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00635-4"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132901"},{"key":"e_1_3_2_1_34_1","volume-title":"DGAI: Decoupled On-Disk Graph-Based ANN Index for Efficient Updates and Queries. arXiv preprint arXiv:2510.25401","author":"Lou Jiahao","year":"2025","unstructured":"Jiahao Lou, Quan Yu, Shufeng Gong, Song Yu, Yanfeng Zhang, and Ge Yu. 2025. DGAI: Decoupled On-Disk Graph-Based ANN Index for Efficient Updates and Queries. arXiv preprint arXiv:2510.25401 (2025)."},{"key":"e_1_3_2_1_35_1","first-page":"246","article-title":"HVS: hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search","volume":"15","author":"Lu Kejing","year":"2021","unstructured":"Kejing Lu, Mineichi Kudo, Chuan Xiao, and Yoshiharu Ishikawa. 2021. HVS: hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search. PVLDB, Vol. 15, 2 (2021), 246-258.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_36_1","volume-title":"Cracking Vector Search Indexes. arXiv preprint arXiv:2503.01823","author":"Mageirakos Vasilis","year":"2025","unstructured":"Vasilis Mageirakos, Bowen Wu, and Gustavo Alonso. 2025. Cracking Vector Search Indexes. arXiv preprint arXiv:2503.01823 (2025)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44415-3_4"},{"key":"e_1_3_2_1_38_1","first-page":"824","volume-title":"IEEE TPAMI","volume":"42","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 TPAMI, Vol. 42, 4 (2018), 824-836."},{"key":"e_1_3_2_1_39_1","volume-title":"Anil Pacaci, Ihab F Ilyas, Theodoros Rekatsinas, and Shivaram Venkataraman.","author":"Mohoney Jason","year":"2025","unstructured":"Jason Mohoney, Devesh Sarda, Mengze Tang, Shihabur Rahman Chowdhury, Anil Pacaci, Ihab F Ilyas, Theodoros Rekatsinas, and Shivaram Venkataraman. 2025. Quake: Adaptive Indexing for Vector Search. arXiv preprint arXiv:2506.03437 (2025)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"e_1_3_2_1_41_1","volume-title":"DiskANN: Efficient page-based search over isomorphic mapped graph index using query-sensitivity entry vertex. arXiv preprint arXiv:2310.00402","author":"Ni Jiongkang","year":"2023","unstructured":"Jiongkang Ni, Xiaoliang Xu, Yuxiang Wang, Can Li, Jiajie Yao, Shihai Xiao, and Xuecang Zhang. 2023. DiskANN: Efficient page-based search over isomorphic mapped graph index using query-sensitivity entry vertex. arXiv preprint arXiv:2310.00402 (2023)."},{"key":"e_1_3_2_1_42_1","volume-title":"BlendHouse: A Cloud-Native Vector Database System in ByteHouse","author":"Niu Zhaojie","year":"2025","unstructured":"Zhaojie Niu, Xinhui Tian, Xindong Peng, and Xing Chen. 2025. BlendHouse: A Cloud-Native Vector Database System in ByteHouse. IEEE ICDE (2025), 4332-4345."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626246.3654691"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588908"},{"key":"e_1_3_2_1_45_1","volume-title":"MicroNN: An On-device Disk-resident Updatable Vector Database. In Companion of the 2025 International Conference on Management of Data. 608-621","author":"Pound Jeffrey","year":"2025","unstructured":"Jeffrey Pound, Floris Chabert, Arjun Bhushan, Ankur Goswami, Anil Pacaci, and Shihabur Rahman Chowdhury. 2025. MicroNN: An On-device Disk-resident Updatable Vector Database. In Companion of the 2025 International Conference on Management of Data. 608-621."},{"key":"e_1_3_2_1_46_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 preprint arXiv:2105.09613 (2021)."},{"key":"e_1_3_2_1_47_1","volume-title":"TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning. ACM SIGMOD","author":"Song Yitong","year":"2025","unstructured":"Yitong Song, Pengcheng Zhang, Chao Gao, Bin Yao, Kai Wang, Zongyuan Wu, and Lin Qu. 2025. TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning. ACM SIGMOD (2025), 1-26."},{"key":"e_1_3_2_1_48_1","volume-title":"SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. PVLDB","author":"Sun Yifang","year":"2014","unstructured":"Yifang Sun, Wei Wang, Jianbin Qin, Ying Zhang, and Xuemin Lin. 2014. SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. PVLDB (2014)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806912"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639269"},{"key":"e_1_3_2_1_51_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_3_2_1_52_1","volume-title":"LEANN: A Low-Storage Vector Index. arXiv preprint arXiv:2506.08276","author":"Wang Yichuan","year":"2025","unstructured":"Yichuan Wang, Shu Liu, Zhifei Li, Yongji Wu, Ziming Mao, Yilong Zhao, Xiao Yan, Zhiying Xu, Yang Zhou, Ion Stoica, et al., 2025. LEANN: A Low-Storage Vector Index. arXiv preprint arXiv:2506.08276 (2025)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3709743"},{"key":"e_1_3_2_1_55_1","volume-title":"Spfresh: Incremental in-place update for billion-scale vector search. SOSP","author":"Xu Yuming","year":"2023","unstructured":"Yuming Xu, Hengyu Liang, Jin Li, Shuotao Xu, Qi Chen, Qianxi Zhang, Cheng Li, Ziyue Yang, Fan Yang, Yuqing Yang, et al., 2023. Spfresh: Incremental in-place update for billion-scale vector search. SOSP (2023), 545-561."},{"key":"e_1_3_2_1_56_1","volume-title":"Gorgeous: Revisiting the Data Layout for Disk-Resident High-Dimensional Vector Search. arXiv preprint arXiv:2508.15290","author":"Yin Peiqi","year":"2025","unstructured":"Peiqi Yin, Xiao Yan, Qihui Zhou, Hui Li, Xiaolu Li, Lin Zhang, Meiling Wang, Xin Yao, and James Cheng. 2025. Gorgeous: Revisiting the Data Layout for Disk-Resident High-Dimensional Vector Search. arXiv preprint arXiv:2508.15290 (2025)."},{"key":"e_1_3_2_1_57_1","first-page":"4337","article-title":"Select Edges Wisely","volume":"18","author":"Yue Ziyang","year":"2025","unstructured":"Ziyang Yue, Bolong Zheng, Ling Xu, Kanru Xu, Shuhao Zhang, Yajuan Du, Yunjun Gao, Xiaofang Zhou, and Christian S Jensen. 2025. Select Edges Wisely: Monotonic Path Aware Graph Layout Optimization for Disk-Based ANN Search. PVLDB, Vol. 18, 11 (2025), 4337-4349.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_58_1","unstructured":"Channy Yun. 2025. Introducing Amazon S3 Vectors: First cloud storage with native vector support at scale (preview). https:\/\/aws.amazon.com\/cn\/blogs\/aws\/introducing-amazon-s3-vectors-first-cloud-storage-with-native-vector-support-at-scale\/ Blog post AWS News Blog."},{"key":"e_1_3_2_1_59_1","volume-title":"Highly Efficient Disk-based Nearest Neighbor Search on Extended Neighborhood Graph. ACM SIGIR","author":"Zhang Cheng","year":"2025","unstructured":"Cheng Zhang, Jianzhi Wang, Wan-Lei Zhao, and Shihai Xiao. 2025. Highly Efficient Disk-based Nearest Neighbor Search on Extended Neighborhood Graph. ACM SIGIR (2025), 2513-2523."},{"key":"e_1_3_2_1_60_1","volume-title":"Zoom: SSD-based vector search for optimizing accuracy, latency and memory. arXiv preprint arXiv:1809.04067","author":"Zhang Minjia","year":"2018","unstructured":"Minjia Zhang and Yuxiong He. 2018. Zoom: SSD-based vector search for optimizing accuracy, latency and memory. arXiv preprint arXiv:1809.04067 (2018)."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594527"},{"key":"e_1_3_2_1_62_1","volume-title":"LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search. arXiv preprint arXiv:2505.17152","author":"Zhong Shurui","year":"2025","unstructured":"Shurui Zhong, Dingheng Mo, and Siqiang Luo. 2025. LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search. arXiv preprint arXiv:2505.17152 (2025)."}],"event":{"name":"SIGMOD\/PODS '26: International Conference on Management of Data","location":"Bengaluru India","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Companion of the International Conference on Management of Data"],"original-title":[],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T19:16:32Z","timestamp":1779822992000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3788853.3801879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,30]]},"references-count":62,"alternative-id":["10.1145\/3788853.3801879","10.1145\/3788853"],"URL":"https:\/\/doi.org\/10.1145\/3788853.3801879","relation":{},"subject":[],"published":{"date-parts":[[2026,5,30]]},"assertion":[{"value":"2026-05-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}