{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:21:52Z","timestamp":1773886912327,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,8]]},"DOI":"10.1145\/3701716.3715576","type":"proceedings-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T14:10:32Z","timestamp":1750687832000},"page":"1303-1307","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Scalable Overload-Aware Graph-Based Index Construction for 10-Billion-Scale Vector Similarity Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2042-5405","authenticated-orcid":false,"given":"Yang","family":"Shi","sequence":"first","affiliation":[{"name":"Xiaohongshu Inc, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9559-8268","authenticated-orcid":false,"given":"Yiping","family":"Sun","sequence":"additional","affiliation":[{"name":"Xiaohongshu Inc, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7993-4755","authenticated-orcid":false,"given":"Jiaolong","family":"Du","sequence":"additional","affiliation":[{"name":"Xiaohongshu Inc, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8673-2995","authenticated-orcid":false,"given":"Xiaocheng","family":"Zhong","sequence":"additional","affiliation":[{"name":"Xiaohongshu Inc, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5414-2540","authenticated-orcid":false,"given":"Zhiyong","family":"Wang","sequence":"additional","affiliation":[{"name":"Xiaohongshu Inc, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1274-7111","authenticated-orcid":false,"given":"Yao","family":"Hu","sequence":"additional","affiliation":[{"name":"Xiaohongshu Inc, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783405"},{"key":"e_1_3_2_1_2_1","volume-title":"Retrieved","year":"2010","unstructured":"Anon. 2010. Datasets for approximate nearest neighbor search. Retrieved October 05, 2020 from http:\/\/corpus-texmex.irisa.fr\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"e_1_3_2_1_4_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_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_6_1","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. (2024). arxiv: 2401.08281 [cs.LG]"},{"key":"e_1_3_2_1_7_1","volume-title":"Fast approximate nearest neighbor search with the navigating spreading-out graph. arXiv preprint arXiv:1707.00143","author":"Fu Cong","year":"2017","unstructured":"Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai. 2017. Fast approximate nearest neighbor search with the navigating spreading-out graph. arXiv preprint arXiv:1707.00143 (2017)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"e_1_3_2_1_9_1","volume-title":"Optimization of indexing based on k-nearest neighbor graph for proximity search in high-dimensional data. arXiv preprint arXiv:1810.07355","author":"Iwasaki Masajiro","year":"2018","unstructured":"Masajiro Iwasaki and Daisuke Miyazaki. 2018. Optimization of indexing based on k-nearest neighbor graph for proximity search in high-dimensional data. arXiv preprint arXiv:1810.07355 (2018)."},{"key":"e_1_3_2_1_10_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. Advances in Neural Information Processing Systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_11_1","volume-title":"Piperag: Fast retrieval-augmented generation via algorithm-system co-design. arXiv preprint arXiv:2403.05676","author":"Jiang Wenqi","year":"2024","unstructured":"Wenqi Jiang, Shuai Zhang, Boran Han, Jie Wang, Bernie Wang, and Tim Kraska. 2024. Piperag: Fast retrieval-augmented generation via algorithm-system co-design. arXiv preprint arXiv:2403.05676 (2024)."},{"key":"e_1_3_2_1_12_1","volume-title":"Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems. Parallel computing","author":"Khaldi Dounia","year":"2015","unstructured":"Dounia Khaldi, Pierre Jouvelot, and Corinne Ancourt. 2015. Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems. Parallel computing, Vol. 41 (2015), 66--89."},{"key":"e_1_3_2_1_13_1","volume-title":"Jyothi Vedurada, et al.","author":"Khan Saim","year":"2024","unstructured":"Saim Khan, Somesh Singh, Harsha Vardhan Simhadri, Jyothi Vedurada, et al. 2024. BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU. arXiv preprint arXiv:2401.11324 (2024)."},{"key":"e_1_3_2_1_14_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, Vol. 42, 4 (2018), 824--836."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00323"},{"key":"e_1_3_2_1_16_1","volume-title":"GloVe: Global Vectors for Word Representation. Retrieved","author":"Pennington Jeffrey","year":"2020","unstructured":"Jeffrey Pennington, Richard Socher, and Christopher D. Manning. 2015. GloVe: Global Vectors for Word Representation. Retrieved April 15, 2020 from http:\/\/nlp.stanford.edu\/projects\/glove\/."},{"key":"e_1_3_2_1_17_1","volume-title":"A Survey of Neighbourhood Construction Models for Categorizing Data Points. arXiv preprint arXiv:1810.03083","author":"Pourbahrami Shahin","year":"2018","unstructured":"Shahin Pourbahrami and Leyli Mohammad Khanli. 2018. A Survey of Neighbourhood Construction Models for Categorizing Data Points. arXiv preprint arXiv:1810.03083 (2018)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1011417"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330875"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627673.3680054"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"}],"event":{"name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia","acronym":"WWW '25","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Companion Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701716.3715576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T18:24:51Z","timestamp":1759861491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701716.3715576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":22,"alternative-id":["10.1145\/3701716.3715576","10.1145\/3701716"],"URL":"https:\/\/doi.org\/10.1145\/3701716.3715576","relation":{},"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"2025-05-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}