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

江宇轩 等: 权重残差向量量化: 向量压缩与分层索引结构 1119

inference data. In: Proc. of the 2017 Conf. on Empirical Methods in Natural Language Processing. Copenhagen: ACL, 2017. 670–680.
[doi: 10.18653/v1/D17-1070]
[9] Reimers N, Gurevych I. Sentence-BERT: Sentence embeddings using siamese BERT-networks. In: Proc. of the 2019 Conf. on Empirical
Methods in Natural Language Processing and the 9th Int’l Joint Conf. on Natural Language Processing. Hong Kong: ACL, 2019.
3982–3992. [doi: 10.18653/v1/D19-1410]
[10] Muennighoff N, Tazi N, Magne L, Reimers N. MTEB: Massive text embedding benchmark. In: Proc. of the 17th Conf. of the European
Chapter of the Association for Computational Linguistics. Dubrovnik: ACL, 2022. 2014–2037. [doi: 10.18653/v1/2023.eacl-main.148]
[11] Gao T, Yao X, Chen D. SimCSE: Simple contrastive learning of sentence embeddings. In: Proc. of the 2021 Conf. on Empirical Methods
in Natural Language Processing (EMNLP). Punta Cana: ACL, 2021. 6894–6910. [doi: 10.18653/v1/2021.emnlp-main.552]
[12] Brown TB, Mann B, Ryder N, Subbiah M, Kaplan J, Dhariwal P, Neelakantan A, Shyam P, Sastry G, Askell A, Agarwal S, Herbert-Voss
A, Krueger G, Henighan T, Child R, Ramesh A, Ziegler DM, Wu J, Winter C, Hesse C, Chen M, Sigler E, Litwin M, Gray S, Chess B,
Clark J, Berner C, McCandlish S, Radford A, Sutskever I, Amodei D. Language models are few-shot learners. In: Proc. of the 34th Int’l
Conf. on Neural Information Processing Systems. Vancouver: Curran Associates Inc., 2020. 159.
[13] Radford A, Kim JW, Hallacy C, Ramesh A, Goh G, Agarwal S, Sastry G, Askell A, Mishkin P, Clark J, Krueger G, Sutskever I. Learning
transferable visual models from natural language supervision. In: Proc. of the 38th Int’l Conf. on Machine Learning. 2021. 8784–8763.
[14] Jie Tao, Lei Zhang, Ying Li, Zhi Chen. Optimizing LLM embeddings via prompting and data-driven tuning. In: Proc. of the 62nd Annual
Meeting of the Association for Computational Linguistics, Vol. 1 (Long Papers). Bangkok: ACL, 2024. 1234–1245.
[15] Xiao ST, Liu Z, Zhang PT, Muennighoff N, Lian DF, Nie JY. C-Pack: Packed resources for general Chinese embeddings. In: Proc. of the
47th Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval. Washington: ACM, 2024. 641–649. [doi: 10.1145/
3626772.3657878]
[16] Yang W, Li T, Fang G, Wei H. PASE: PostgreSQL ultra-high-dimensional approximate nearest neighbor search extension. In: Proc. of
the 2020 ACM SIGMOD Int’l Conf. on Management of Data. Portland: ACM, 2020. 2241–2253. [doi: 10.1145/3318464.3386131]
[17] Wei CX, Wu B, Wang S, Lou RJ, Zhan CQ, Li FF, Cai YZ. AnalyticDB-V: A hybrid analytical engine towards query fusion for
structured and unstructured data. Proc. of the VLDB Endowment, 2020, 13(12): 3152–3165. [doi: 10.14778/3415478.3415541]
[18] Johnson J, Douze M, Jégou H. Billion-scale similarity search with GPUs. IEEE Trans. on Big Data, 2021, 7(3): 535–547. [doi: 10.1109/
TBDATA.2019.2921572]
[19] 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]
[20] Chroma is the open-source search and retrieval database for AI applications. 2025. https://www.trychroma.com
[21] Stonebraker M, Cetintemel U. “One size fits all”: An idea whose time has come and gone. In: Proc. of the 21st Int’l Conf. on Data
Engineering. Tokyo: IEEE, 2005. 2–11. [doi: 10.1109/ICDE.2005.1]
[22] Dittrich J, Jindal A. Towards a one size fits all database architecture. In: Proc. of the 5th Biennial Conf. on Innovative Data Systems
Research. 2011. 195–198.
[23] Zhang YN, Liu SG, Wang JG. Are there fundamental limitations in supporting vector data management in relational databases? A case
study of PostgreSQL. In: Proc. of the 40th IEEE Int’l Conf. on Data Engineering (ICDE). Utrecht: IEEE, 2024. 3640–3653. [doi: 10.1109/
ICDE60146.2024.00280]
[24] Beis JS, Lowe DG. Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: Proc. of the 1997 IEEE
Computer Society Conf. on Computer Vision and Pattern Recognition. San Juan: IEEE, 1997. 1000–1006. [doi: 10.1109/CVPR.1997.
609451]
[25] Muja M, Lowe DG. Fast approximate nearest neighbors with automatic algorithm configuration. In: Proc. of the 4th Int’l Conf. on
Computer Vision Theory and Applications. 2009. 861–864.
[26] Jégou H, Tavenard R, Douze M, Amsaleg L. Searching in one billion vectors: Re-rank with source coding. In: Proc. of the 2011 IEEE Int’l
Conf. on Acoustics, Speech and Signal Processing. Prague: IEEE, 2011. 861–864. [doi: 10.1109/ICASSP.2011.5946540]
[27] 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]
[28] 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]
[29] Zhang HL, Zhao PH, Miao XP, Shao YX, Liu ZR, Yang T, Cui B. Experimental analysis of large-scale learnable vector storage
compression. Proc. of the VLDB Endowment, 2023, 17(4): 808–822. [doi: 10.14778/3636218.3636234]