Page 57 - 《软件学报》2026年第3期

1020 软件学报 2026 年第 37 卷第 3 期

[3] Zhang JH, Zhu YQ, Liu Q, Wu S, Wang SH, Wang L. Mining latent structures for multimedia recommendation. In: Proc. of the 29th
ACM Int’l Conf. on Multimedia. ACM, 2021. 3872–3880. [doi: 10.1145/3474085.3475259]
[4] Franceschi L, Niepert M, Pontil M, He X. Learning discrete structures for graph neural networks. In: Proc. of the 36th Int’l Conf. on
Machine Learning. 2019. 1972–1982.
[5] Deng CH, Li XY, Feng Z, Zhang ZR. GARNET: Reduced-rank topology learning for robust and scalable graph neural networks. In: Proc.
of the 1st Learning on Graphs Conf. 2022. 198: 3:1–3:23.
[6] Pan JJ, Wang JG, Li GL. Survey of vector database management systems. The VLDB Journal, 2024, 33(5): 1591–1615. [doi: 10.1007/
S00778-024-00864-x]
[7] Eppstein D, Paterson MS, Yao FF. On nearest-neighbor graphs. Discrete & Computational Geometry, 1997, 17(3): 263–282. [doi: 10.
1007/PL00009293]
[8] Pan JJ, Wang JG, Li GL. Vector database management techniques and systems. In: Proc. of the Companion of the 2024 Int’l Conf. on
Management of Data. Santiago: ACM, 2024. 597–604. [doi: 10.1145/3626246.3654691]
[9] Silpa-Anan C, Hartley R. Optimised KD-trees for fast image descriptor matching. In: Proc. of the 2018 IEEE Conf. on Computer Vision
and Pattern Recognition. Anchorage: IEEE, 2008. 1–8. [doi: 10.1109/CVPR.2008.4587638]
[10] Wang J, Wang JD, Zeng G, Tu ZW, Gan R, Li SP. Scalable k-NN graph construction for visual descriptors. In: Proc. of the 2012 IEEE
Conf. on Computer Vision and Pattern Recognition. Providence: IEEE, 2012. 1106–1113. [doi: 10.1109/CVPR.2012.6247790]
[11] Dong W, Moses C, Li K. Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proc. of the 20th Int’l Conf.
on World Wide Web. Hyderabad: ACM, 2011. 577–586. [doi: 10.1145/1963405.1963487]
[12] Malkov YA, Yashunin DA. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs.
IEEE Trans. on Pattern Analysis and Machine Intelligence, 2020, 42(4): 824–836. [doi: 10.1109/TPAMI.2018.2889473]
[13] Sun J, Li GL, Pan J, Wang J, Xie YQ, Liu RC, Nie W. GaussDB-vector: A large-scale persistent real-time vector database for LLM
applications. Proc. of the VLDB Endowment, 2025, 18(12): 4951–4963. [doi: 10.14778/3750601.3750619]
[14] Krishnaswamy R, Manohar MD, Simhadri HV. The DiskANN library: Graph-based indices for fast, fresh and filtered vector search. IEEE
Data Engineering Bulletin, 2024, 48(3): 20–42.
[15] Sundaram N, Turmukhametova A, Satish N, Mostak T, Indyk P, Madden S, Dubey P. Streaming similarity search over one billion Tweets
using parallel locality-sensitive hashing. Proc. of the VLDB Endowment, 2013, 6(14): 1930–1941. [doi: 10.14778/2556549.2556574]
[16] Wang JG, Yi XM, Guo RT, Jin H, Xu P, Li SJ, Wang XY, Guo XZ, Li CM, Xu XH, Yu K, Yuan YX, Zou YH, Long JQ, Cai YD, Li ZX,
Zhang ZF, Mo YH, Gu J, Jiang RY, Wei Y, Xie C. Milvus: A purpose-built vector data management system. In: Proc. of the 2021 Int’l
Conf. on Management of Data. ACM, 2021. 2614–2627. [doi: 10.1145/3448016.3457550]
[17] Xu YM, Liang HY, Li J, Xu ST, Chen Q, Zhang QX, Li C, Yang ZY, Yang F, Yang YQ, Cheng P, Yang M. SPFresh: Incremental in-
place update for billion-scale vector search. In: Proc. of the 29th Symp. on Operating Systems Principles. Koblenz: ACM, 2023. 545–561.
[doi: 10.1145/3600006.3613166]
[18] Gollapudi S, Karia N, Sivashankar V, Krishnaswamy R, Begwani N, Raz S, Lin YY, Zhang Y, Mahapatro N, Srinivasan P, Singh A,
Simhadri HV. Filtered-DiskANN: Graph algorithms for approximate nearest neighbor search with filters. In: Proc. of the ACM Web
Conf. 2023. Austin: ACM, 2023. 3406–3416. [doi: 10.1145/3543507.3583552]
[19] Jégou H, Douze M, Schmid C. Product quantization for nearest neighbor search. IEEE Trans. on Pattern Analysis and Machine
Intelligence, 2011, 33(1): 117–128. [doi: 10.1109/TPAMI.2010.57]
[20] Ge TZ, He KM, Ke QF, Sun J. Optimized product quantization for approximate nearest neighbor search. In: Proc. of the 2023 IEEE Conf.
on Computer Vision and Pattern Recognition. Portland: IEEE, 2013. 2946–2953. [doi: 10.1109/CVPR.2013.379]
[21] Bae G, de La Gorce M, Baltrušaitis T, Hewitt C, Chen D, Valentin J, Cipolla R, Shen JJ. Digiface-1M: 1 million digital face images for
face recognition. In: Proc. of the 2023 IEEE/CVF Winter Conf. on Applications of Computer Vision. Waikoloa: IEEE, 2023. 3515–3524.
[doi: 10.1109/WACV56688.2023.00352]
[22] Dosovitskiy A, Beyer L, Kolesnikov A, Weissenborn D, Zhai XH, Unterthiner T, Dehghani M, Minderer M, Heigold G, Gelly S,
Uszkoreit J, Houlsby N. An image is worth 16×16 words: Transformers for image recognition at scale. In: Proc. of the 9th Int’l Conf. on
Learning Representations. 2021.

作者简介
王嘉翼, 博士生, CCF 学生会员, 主要研究领域为人工智能和数据管理的交叉技术.
徐士惠, 博士生, 主要研究领域为基于人工智能的数据库优化技术.
李国良, 博士, 教授, 博士生导师, CCF 杰出会员, 主要研究领域为大数据, 数据库, 数据科学.