{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T20:02:47Z","timestamp":1779825767463,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,5,31]]},"DOI":"10.1145\/3788853.3803088","type":"proceedings-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T19:14:47Z","timestamp":1779822887000},"page":"451-463","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["LindormVector: A Distributed Vector Engine on a Cloud-Native Multi-Model NoSQL Database"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9266-1253","authenticated-orcid":false,"given":"Yan","family":"Wang","sequence":"first","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5559-7438","authenticated-orcid":false,"given":"Jian","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2902-2094","authenticated-orcid":false,"given":"Sai","family":"Huang","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7111-4265","authenticated-orcid":false,"given":"Chao","family":"Dou","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8862-2068","authenticated-orcid":false,"given":"Hanwen","family":"Tian","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2425-1284","authenticated-orcid":false,"given":"Zhijie","family":"Jiang","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2083-3153","authenticated-orcid":false,"given":"Zongning","family":"Zhang","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9492-152X","authenticated-orcid":false,"given":"Xiaoqi","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4182-0075","authenticated-orcid":false,"given":"Zhencan","family":"Peng","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, New Jersey, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9704-4272","authenticated-orcid":false,"given":"Chunhui","family":"Shen","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1417-7995","authenticated-orcid":false,"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0770-5775","authenticated-orcid":false,"given":"Feifei","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4596-3850","authenticated-orcid":false,"given":"Dong","family":"Deng","sequence":"additional","affiliation":[{"name":"Alibaba Cloud, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Chroma. https:\/\/www.trychroma.com. Accessed: 2025-10-26."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. Clickhouse. http:\/\/clickhouse.com. Accessed: 2025-10-26."},{"key":"e_1_3_2_1_3_1","unstructured":"[n.d.]. Elasticsearch. http:\/\/elastic.co. Accessed: 2025-10-26."},{"key":"e_1_3_2_1_4_1","unstructured":"[n.d.]. PGVector. https:\/\/github.com\/pgvector\/pgvector."},{"key":"e_1_3_2_1_5_1","unstructured":"[n.d.]. Pinecone. http:\/\/pinecone.io. Accessed: 2025-10-26."},{"key":"e_1_3_2_1_6_1","unstructured":"[n.d.]. Qdrant. https:\/\/qdrant.tech. Accessed: 2025-10-26."},{"key":"e_1_3_2_1_7_1","unstructured":"[n.d.]. Redis. http:\/\/redis.io. Accessed: 2025-10-26."},{"key":"e_1_3_2_1_8_1","unstructured":"[n.d.]. Weaviate. http:\/\/weaviate.io. Accessed: 2025-10-26."},{"key":"e_1_3_2_1_9_1","volume-title":"DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers.arXiv preprint arXiv:2509.06046(2025).","author":"Adams Philip","year":"2025","unstructured":"Philip Adams, Menghao Li, Shi Zhang, Li Tan, Qi Chen, Mingqin Li, Zengzhong Li, Knut Risvik, and Harsha Vardhan Simhadri. 2025. DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers.arXiv preprint arXiv:2509.06046(2025)."},{"key":"e_1_3_2_1_10_1","volume-title":"In42nd International Conference on Very Large Data Bases","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. In42nd International Conference on Very Large Data Bases, Vol. 9. 12."},{"key":"e_1_3_2_1_11_1","volume-title":"InProceedings of the 2017 ACM on International Conference on Multimedia Retrieval. 159-166","author":"Andr\u00e9 Fabien","year":"2017","unstructured":"Fabien Andr\u00e9, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2017. Acceler- ated nearest neighbor search with quick adc. InProceedings of the 2017 ACM on International Conference on Multimedia Retrieval. 159-166."},{"key":"e_1_3_2_1_12_1","volume-title":"Quicker adc: Unlocking the hidden potential of product quantization with simd","author":"Andr\u00e9 Fabien","year":"2019","unstructured":"Fabien Andr\u00e9, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2019. Quicker adc: Unlocking the hidden potential of product quantization with simd.IEEE transactions on pattern analysis and machine intelligence43, 5 (2019), 1666-1677."},{"key":"e_1_3_2_1_13_1","volume-title":"InProceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2055-2063","author":"Babenko Artem","year":"2016","unstructured":"Artem Babenko and Victor Lempitsky. 2016. Efficient indexing of billion-scale datasets of deep descriptors. InProceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2055-2063."},{"key":"e_1_3_2_1_14_1","volume-title":"Singlestore-v: An integrated vector database system in singlestore.Proceedings of the VLDB Endowment17, 12","author":"Chen Cheng","year":"2024","unstructured":"Cheng Chen, Chenzhe Jin, Yunan Zhang, Sasha Podolsky, Chun Wu, Szu-Po Wang, Eric Hanson, Zhou Sun, Robert Walzer, and Jianguo Wang. 2024. Singlestore-v: An integrated vector database system in singlestore.Proceedings of the VLDB Endowment17, 12 (2024), 3772-3785."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572114"},{"key":"e_1_3_2_1_16_1","volume-title":"The Faiss library.CoRRabs\/2401.08281","author":"Douze Matthijs","year":"2024","unstructured":"Matthijs Douze, Alexandr Guzhva, Chengqi Deng, Jeff Johnson, Gergely Szilvasy, Pierre-Emmanuel Mazar\u00e9, Maria Lomeli, Lucas Hosseini, and Herv\u00e9 J\u00e9gou. 2024. The Faiss library.CoRRabs\/2401.08281 (2024). arXiv:2401.08281 doi:10.48550\/ ARXIV.2401.08281"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3408815"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654970"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3226595.3226635"},{"key":"e_1_3_2_1_21_1","first-page":"604","article-title":"Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality","author":"Indyk Piotr","year":"1998","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. InSTOC. 604-613.","journal-title":"InSTOC."},{"key":"e_1_3_2_1_22_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 intelligence33, 1 (2010), 117-128."},{"key":"e_1_3_2_1_23_1","first-page":"861","article-title":"Searching in one billion vectors: re-rank with source coding. In2011 IEEE Inter- national Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"J\u00e9gou Herv\u00e9","year":"2011","unstructured":"Herv\u00e9 J\u00e9gou, Romain Tavenard, Matthijs Douze, and Laurent Amsaleg. 2011. Searching in one billion vectors: re-rank with source coding. In2011 IEEE Inter- national Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 861-864.","journal-title":"IEEE"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607045"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_27_1","first-page":"281","volume-title":"InProceedings ofthe 5th Berkeley Symposium on Mathematical Statisticsand Probability","volume":"1","author":"MacQueen J","year":"1967","unstructured":"J MacQueen. 1967. Multivariate observations. InProceedings ofthe 5th Berkeley Symposium on Mathematical Statisticsand Probability, Vol. 1. 281-297."},{"key":"e_1_3_2_1_28_1","volume-title":"Approximate nearest neighbor algorithm based on navigable small world graphs.Information Systems45","author":"Malkov Yury","year":"2014","unstructured":"Yury Malkov, Alexander Ponomarenko, Andrey Logvinov, and Vladimir Krylov. 2014. Approximate nearest neighbor algorithm based on navigable small world graphs.Information Systems45 (2014), 61-68."},{"key":"e_1_3_2_1_29_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs.TPAMI 42, 4","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.TPAMI 42, 4 (2018), 824-836."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Qianyu Ouyang Chunhui Shen Wenlong Yang Peng Yu Qiang Xiao Jianhui Lei Yadong Chen Qilu Zhong Xiang Wang Yong Lin et al. 2024. Lindorm-UWC: An Ultra-Wide-Column Database for Internet of Vehicles.Proceedings of the VLDB Endowment17 12 (2024) 4117-4129.","DOI":"10.14778\/3685800.3685831"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654923"},{"key":"e_1_3_2_1_32_1","unstructured":"Nils Reimers and Jay Alammar. 2023. The Embedding Archives: Millions of Wikipedia Article Embeddings in Many Languages. https:\/\/cohere.com\/blog\/ embedding-archives-wikipedia."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Chunhui Shen Qianyu Ouyang Feibo Li Zhipeng Liu Longcheng Zhu Yujie Zou Qing Su Tianhuan Yu Yi Yi Jianhong Hu et al. 2023. Lindorm TSDB: A cloud-native time-series database for large-scale monitoring systems.Proceedings of the VLDB Endowment16 12 (2023) 3715-3727.","DOI":"10.14778\/3611540.3611559"},{"key":"e_1_3_2_1_34_1","first-page":"177","article-title":"Results of the NeurIPS'21 challenge on billion-scale approximate nearest neighbor search. InNeurIPS 2021 Competitions and Demonstrations Track","author":"Simhadri Harsha Vardhan","year":"2022","unstructured":"Harsha Vardhan Simhadri, George Williams, Martin Aum\u00fcller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krish- naswamny, Gopal Srinivasa, et al. 2022. Results of the NeurIPS'21 challenge on billion-scale approximate nearest neighbor search. InNeurIPS 2021 Competitions and Demonstrations Track. PMLR, 177-189.","journal-title":"PMLR"},{"key":"e_1_3_2_1_35_1","volume-title":"Eliot Wong Robson, and Da Wei Zheng","author":"Spalding-Jamieson Jack","year":"2025","unstructured":"Jack Spalding-Jamieson, Eliot Wong Robson, and Da Wei Zheng. 2025. Scalable k- Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search. arXiv preprint arXiv:2502.06163(2025)."},{"key":"e_1_3_2_1_36_1","volume-title":"Ravishankar Kr- ishaswamy, and Harsha Vardhan Simhadri","author":"Subramanya Suhas Jayaram","year":"2019","unstructured":"Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Kr- ishaswamy, 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_37_1","volume-title":"GaussDB-Vector: A Large-Scale Persistent Real-Time Vector Database for LLM Applications.Proceedings of the VLDB Endowment18, 12","author":"Sun Ji","year":"2025","unstructured":"Ji Sun, Guoliang Li, James Pan, Jiang Wang, Yongqing Xie, Ruicheng Liu, and Wen Nie. 2025. GaussDB-Vector: A Large-Scale Persistent Real-Time Vector Database for LLM Applications.Proceedings of the VLDB Endowment18, 12 (2025), 4951-4963."},{"key":"e_1_3_2_1_38_1","unstructured":"Milvus Team. 2025. Vector Search in the Real World: How to Filter Efficiently Without Killing Recall. https:\/\/milvus.io\/blog\/how-to-filter-efficiently-without- killing-recall.md. Accessed: 2025-10-17."},{"key":"e_1_3_2_1_39_1","volume-title":"The relative neighbourhood graph of a finite planar set.Pattern recognition12, 4","author":"Toussaint Godfried T","year":"1980","unstructured":"Godfried T Toussaint. 1980. The relative neighbourhood graph of a finite planar set.Pattern recognition12, 4 (1980), 261-268."},{"key":"e_1_3_2_1_40_1","volume-title":"Dimitris Polychronopoulos, et al.","author":"Tsatsaronis George","year":"2015","unstructured":"George Tsatsaronis, Georgios Balikas, Prodromos Malakasiotis, Ioannis Partalas, Matthias Zschunke, Michael R Alvers, Dirk Weissenborn, Anastasia Krithara, Ser- gios Petridis, Dimitris Polychronopoulos, et al. 2015. An overview of the BIOASQ large-scale biomedical semantic indexing and question answering competition. BMC bioinformatics16, 1 (2015), 138."},{"key":"e_1_3_2_1_41_1","volume-title":"Hari Sudan Sundar, Krishnan Sundaram, Samer Boshra, Balachandar Perumalswamy, Shivam Atri, Martin Chisholm, Revti Raman Singh, Greg Yang, et al.","author":"Upreti Nitish","year":"2025","unstructured":"Nitish Upreti, Harsha Vardhan Simhadri, Hari Sudan Sundar, Krishnan Sundaram, Samer Boshra, Balachandar Perumalswamy, Shivam Atri, Martin Chisholm, Revti Raman Singh, Greg Yang, et al. 2025. Cost-Effective, Low Latency Vector Search with Azure Cosmos DB.arXiv preprint arXiv:2505.05885(2025)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"e_1_3_2_1_45_1","volume-title":"Harmony: A scalable distributed vector database for high- throughput approximate nearest neighbor search.Proceedings of the ACM on Management of Data3, 4","author":"Xu Qian","year":"2025","unstructured":"Qian Xu, Feng Zhang, Chengxi Li, Lei Cao, Zheng Chen, Jidong Zhai, and Xi- aoyong Du. 2025. Harmony: A scalable distributed vector database for high- throughput approximate nearest neighbor search.Proceedings of the ACM on Management of Data3, 4 (2025), 1-28."},{"key":"e_1_3_2_1_46_1","volume-title":"Xiyue Gao, Qianru Wang, Yanguo Peng, and Jiangtao Cui.","author":"Yang Shuo","year":"2024","unstructured":"Shuo Yang, Jiadong Xie, Yingfan Liu, Jeffrey Xu Yu, Xiyue Gao, Qianru Wang, Yanguo Peng, and Jiangtao Cui. 2024. Revisiting the index construction of proximity graph-based approximate nearest neighbor search.arXiv preprint arXiv:2410.01231(2024)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386131"},{"key":"e_1_3_2_1_48_1","volume-title":"Zoom: Ssd-based vector search for optimiz- ing accuracy, latency and memory.arXiv preprint arXiv:1809.04067(2018).","author":"Zhang Minjia","year":"2018","unstructured":"Minjia Zhang and Yuxiong He. 2018. Zoom: Ssd-based vector search for optimiz- ing accuracy, latency and memory.arXiv preprint arXiv:1809.04067(2018)."},{"key":"e_1_3_2_1_49_1","volume-title":"In2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, 3640-3653","author":"Zhang Yunan","year":"2024","unstructured":"Yunan Zhang, Shige Liu, and Jianguo Wang. 2024. Are there fundamental limita- tions in supporting vector data management in relational databases? A case study of PostgreSQL. In2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, 3640-3653."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639324"}],"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:15:32Z","timestamp":1779822932000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3788853.3803088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,30]]},"references-count":50,"alternative-id":["10.1145\/3788853.3803088","10.1145\/3788853"],"URL":"https:\/\/doi.org\/10.1145\/3788853.3803088","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"}}]}}