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

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

[82] Babenko A, Lempitsky V. Tree quantization for large-scale similarity search and classification. In: Proc. of the 2015 IEEE Conf. on
Computer Vision and Pattern Recognition (CVPR). Boston: IEEE, 2015. 4240–4248. [doi: 10.1109/CVPR.2015.7299052]
[83] Ning QQ, Zhu JK, Zhong ZY, Hoi SCH, Chen C. Scalable image retrieval by sparse product quantization. IEEE Trans. on Multimedia,
2017, 19(3): 586–597. [doi: 10.1109/TMM.2016.2625260]
[84] Heo JP, Lin Z, Yoon SE. Distance encoded product quantization for approximate K-nearest neighbor search in high-dimensional space.
IEEE Trans. on Pattern Analysis and Machine Intelligence, 2019, 41(9): 2084–2097. [doi: 10.1109/TPAMI.2018.2853161]
[85] Pan ZB, Wang LZ, Wang Y, Liu YC. Product quantization with dual codebooks for approximate nearest neighbor search.
Neurocomputing, 2020, 401: 59–68. [doi: 10.1016/j.neucom.2020.03.016]
[86] Xu Z, Niu LS, Meng RM, Zhao LY, Ji JQ. Residual vector product quantization for approximate nearest neighbor search. In: Gama J, Li
TR, Yu Y, Chen EH, Zheng Y, Teng F, eds. Advances in Knowledge Discovery and Data Mining (PAKDD 2022). Cham: Springer,
2022. 208–220. [doi: 10.1007/978-3-031-05933-9_17]
[87] Xu Z, Zhou MD, Liu YX, Zhao LY, Liu JJ. Approximate nearest neighbor search by cyclic hierarchical product quantization. Signal,
Image and Video Processing, 2025, 19(6): 452. [doi: 10.1007/s11760-025-04030-w]
[88] André F, Kermarrec AM, Le Scouarnec N. Cache locality is not enough: High-performance nearest neighbor search with product
quantization fast scan. Proc. of the VLDB Endowment, 2015, 9(4): 288–299. [doi: 10.14778/2856318.2856324]
[89] Veasey T. Understanding optimized scalar quantization. 2025. https://www.elastic.co/search-labs/blog/scalar-quantization-optimization
[90] Gao JY, Gou YT, Xu YX, Yang YY, C Long, Wong RCW. Practical and asymptotically optimal quantization of high-dimensional
vectors in Euclidean space for approximate nearest neighbor search. Proc. of the ACM on Management of Data, 2025, 3(3): 202. [doi:
10.1145/3725413]
[91] Azizi I, Echihabi K, Palpanas T. ELPIS: Graph-based similarity search for scalable data science. Proc. of the VLDB Endowment, 2023,
16(6): 1548–1559. [doi: 10.14778/3583140.3583166]
[92] Echihabi K, Fatourou P, Zoumpatianos K, Palpanas T, Benbrahim H. Hercules against data series similarity search. Proc. of the VLDB
Endowment, 2022, 15(10): 2005–2018. [doi: 10.14778/3547305.3547308]
[93] Wang Y, Wang P, Pei J, Wang W, Huang S. A data-adaptive and dynamic segmentation index for whole matching on time series. Proc.
of the VLDB Endowment, 2013, 6(10): 793–804. [doi: 10.14778/2536206.2536208]
[94] Babenko A, Lempitsky V. The inverted multi-index. In: Proc. of the 2012 IEEE Conf. on Computer Vision and Pattern Recognition.
Providence: IEEE, 2012. 3069–3076. [doi: 10.1109/CVPR.2012.6248038]
[95] Baranchuk D, Babenko A, Malkov Y. Revisiting the inverted indices for billion-scale approximate nearest neighbors. In: Proc. of the
15th European Conf. on Computer Vision. Munich: Springer, 2018. 209–224. [doi: 10.1007/978-3-030-01258-8_13]
[96] Lu KJ, Kudo M. R2LSH: A nearest neighbor search scheme based on two-dimensional projected spaces. In: Proc. of the 36th IEEE Int’l
Conf. on Data Engineering (ICDE). Dallas: IEEE, 2020. 1045–1056. [doi: 10.1109/ICDE48307.2020.00095]
[97] Tao YF, Yi K, Sheng C, Kalnis P. Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM
Trans. on Database Systems, 2010, 35(3): 20. [doi: 10.1145/1806907.1806912]
[98] Arora A, Sinha S, Kumar P, Bhattacharya A. HD-index: Pushing the scalability-accuracy boundary for approximate kNN search in high-
dimensional spaces. Proc. of the VLDB Endowment, 2018, 11(8): 906–919. [doi: 10.14778/3204028.3204034]
[99] Butz AR. Alternative algorithm for Hilbert’s space-filling curve. IEEE Trans. on Computers, 1971, C-20(4): 424–426. [doi: 10.1109/T-
C.1971.223258]
[100] Zheng BL, Zhao X, Weng LG, Hung NQV, Liu H, Jensen CS. PM-LSH: A fast and accurate LSH framework for high-dimensional
approximate NN search. Proc. of the VLDB Endowment, 2020, 13(5): 643–655. [doi: 10.14778/3377369.3377374]
[101] Skopal T, Pokorný J, Snášel V. Nearest neighbours search using the PM-tree. In: Proc. of the 10th Int’l Conf. on Database Systems for
Advanced Applications. Beijing: Springer, 2005. 803–815. [doi: 10.1007/11408079_73]
[102] Wei JQ, Peng BT, Lee XD, Palpanas T. DET-LSH: A locality-sensitive hashing scheme with dynamic encoding tree for approximate
nearest neighbor search. Proc. of the VLDB Endowment, 2024, 17(9): 2241–2254. [doi: 10.14778/3665844.3665854]
[103] Dong YH, Indyk P, Razenshteyn I, Wagner T. Learning space partitions for nearest neighbor search. In: Proc. of the 8th Int’l Conf. on
Learning Representations. 2020.
[104] Gupta G, Medini T, Shrivastava A, Smola AJ. BLISS: A billion scale index using iterative re-partitioning. In: Proc. of the 28th ACM
SIGKDD Conf. on Knowledge Discovery and Data Mining. Washington: ACM, 2022. 486–495. [doi: 10.1145/3534678.3539414]
[105] Gao JY, Long C. High-dimensional approximate nearest neighbor search: With reliable and efficient distance comparison operations.
Proc. of the ACM on Management of Data, 2023, 1(2): 137. [doi: 10.1145/3589282]
[106] Lu KJ, Xiao C, Ishikawa Y. Probabilistic routing for graph-based approximate nearest neighbor search. In: Proc. of the 41st Int’l Conf.