Page 376 - 《软件学报》2026年第2期

姬涛 等: AI 赋能的关系型数据库系统研究: 标准化、技术与挑战 855

[165] Wu JC, Zhang Y, Chen SM, Wang J, Chen Y, Xing CX. Updatable learned index with precise positions. Proc. of the VLDB
Endowment, 2021, 14(8): 1276–1288. [doi: 10.14778/3457390.3457393]
[166] Wang HX, Fu XY, Xu JL, Lu H. Learned index for spatial queries. In: Proc. of the 20th IEEE Int’l Conf. on Mobile Data Management.
Hong Kong: IEEE, 2019. 569–574. [doi: 10.1109/MDM.2019.00121]
[167] Davitkova A, Milchevski E, Michel S. The ML-index: A multidimensional, learned index for point, range, and nearest-neighbor queries.
In: Proc. of the 23rd Int’l Conf. on Extending Database Technology. Copenhagen: OpenProceedings.org, 2020. 407–410.
[168] Li PF, Lu H, Zheng Q, Yang L, Pan G. LISA: A learned index structure for spatial data. In: Proc. of the 2020 ACM SIGMOD Int’l Conf.
on Management of Data. Portland: ACM, 2020. 2119–2133. [doi: 10.1145/3318464.3389703]
[169] Hadian A, Kumar A, Heinis T. Hands-off model integration in spatial index structures. In: Proc. of the 2nd Int’l Workshop on Applied
AI for Database Systems and Applications. Tokyo: AIDB@VLDB, 2020.
[170] Qi JZ, Liu GL, Jensen CS, Kulik L. Effectively learning spatial indices. Proc. of the VLDB Endowment, 2020, 13(12): 2341–2354. [doi:
10.14778/3407790.3407829]
[171] Yang ZH, Chandramouli B, Wang C, Gehrke J, Li YN, Minhas UF, Larson PÅ, Kossmann D, Acharya R. QD-Tree: Learning data
layouts for big data analytics. In: Proc. of the 2020 ACM SIGMOD Int’l Conf. on Management of Data. Portland: ACM, 2020. 193–208.
[doi: 10.1145/3318464.3389770]
[172] Nathan V, Ding JL, Alizadeh M, Kraska T. Learning multi-dimensional indexes. In: Proc. of the 2020 ACM SIGMOD Int’l Conf. on
Management of Data. Portland: ACM, 2020. 985–1000. [doi: 10.1145/3318464.3380579]
[173] Ding JL, Nathan V, Alizadeh M, Kraska T. Tsunami: A learned multi-dimensional index for correlated data and skewed workloads.
Proc. of the VLDB Endowment, 2020, 14(2): 74–86. [doi: 10.14778/3425879.3425880]
+
[174] Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R. IDistance: An adaptive B -tree based indexing method for nearest neighbor search.
ACM Trans. on Database Systems (TODS), 2005, 30(2): 364–397. [doi: 10.1145/1071610.1071612]
[175] Pai SG, Mathioudakis M, Wang YH. Towards an instance-optimal Z-index. In: Proc. of the 4th Int’l Workshop on Applied AI for
Database Systems and Applications. Sydney, 2022.
[176] Gao J, Cao X, Yao X, Zhang G, Wang W. LMSFC: A novel multidimensional index based on learned monotonic space filling curves.
Proc. of the VLDB Endowment, 2023, 16(10): 2605–2617. [doi: 10.14778/3603581.3603598]
[177] Pai S, Mathioudakis M, Wang YH. WaZI: A learned and workload-aware Z-index. In: Proc. of the 27th Int’l Conf. on Extending
Database Technology. Paestum: OpenProceedings.org, 2024. 559–571.
[178] Guttman A. R-trees: A dynamic index structure for spatial searching. ACM SIGMOD Record, 1984, 14(2): 47–57. [doi: 10.1145/971697.
602266]
[179] Bentley JL. Multidimensional binary search trees used for associative searching. Communications of the ACM, 1975, 18(9): 509–517.
[doi: 10.1145/361002.361007]
[180] Li Z, Chan TN, Yiu ML, Jensen CS. PolyFit: Polynomial-based indexing approach for fast approximate range aggregate queries. In:
Proc. of the 24th Int’l Conf. on Extending Database Technology. Nicosia: OpenProceedings.org, 2021. 241–252.
[181] Peng YX, Zhou W, Zhang L, Du HL. A study of learned KD tree based on learned index. In: Proc. of the 2020 Int’l Conf. on
Networking and Network Applications. Haikou: IEEE, 2020. 355–360. [doi: 10.1109/NaNA51271.2020.00067]
[182] Zhang SN, Ray S, Lu RX, Zheng YD. Efficient learned spatial index with interpolation function based learned model. IEEE Trans. on
Big Data, 2023, 9(2): 733–745. [doi: 10.1109/TBDATA.2022.3186857]
[183] Hadian A, Ghaffari B, Wang TY, Heinis T. COAX: Correlation-aware indexing. In: Proc. of the 39th IEEE Int’l Conf. on Data
Engineering Workshops. Anaheim: IEEE, 2023. 55–59. [doi: 10.1109/ICDEW58674.2023.00014]
[184] Lu Y, Shanbhag A, Jindal A, Madden S. AdaptDB: Adaptive partitioning for distributed joins. Proc. of the VLDB Endowment, 2017,
10(5): 589–600. [doi: 10.14778/3055540.3055551]
[185] Sun LW, Franklin MJ, Krishnan S, Xin RS. Fine-grained partitioning for aggressive data skipping. In: Proc. of the 2014 ACM SIGMOD
Int’l Conf. on Management of Data. Snowbird Utah: ACM, 2014. 1115–1126. [doi: 10.1145/2588555.2610515]
[186] Parchas P, Naamad Y, van Bouwel P, Faloutsos C, Petropoulos M. Fast and effective distribution-key recommendation for amazon
redshift. Proc. of the VLDB Endowment, 2020, 13(12): 2411–2423. [doi: 10.14778/3407790.3407834]
[187] Serafini M, Taft R, Elmore AJ, Pavlo A, Aboulnaga A, Stonebraker M. Clay: Fine-grained adaptive partitioning for general database
schemas. Proc. of the VLDB Endowment, 2016, 10(4): 445–456. [doi: 10.14778/3025111.3025125]
[188] Eldeeb T, Chen ZN, Cidon A, Yang JF. Neuroshard: Towards automatic multi-objective sharding with deep reinforcement learning. In:
Proc. of the 5th Int’l Workshop on Exploiting Artificial Intelligence Techniques for Data Management. Philadelphia: ACM, 2022. 1.
[doi: 10.1145/3533702.3534908]