Page 353 - 《软件学报》2026年第5期

2232 软件学报 2026 年第 37 卷第 5 期

queries over data federation. Proc. of the VLDB Endowment, 2022, 15(6): 1159–1172. [doi: 10.14778/3514061.3514064]
[10] Bentley JL. Multidimensional binary search trees used for associative searching. Communications of the ACM, 1975, 18(9): 509–517.
[doi: 10.1145/361002.361007]
[11] Ram P, Sinha K. Revisiting KD-tree for nearest neighbor search. In: Proc. of the 25th ACM SIGKDD Int’l Conf. on Knowledge
Discovery & Data Mining. Anchorage: ACM, 2019. 1378–1388. [doi: 10.1145/3292500.3330875]
[12] Nurgaliev I, Muzammal M, Qu Q. Enabling blockchain for efficient spatio-temporal query processing. In: Proc. of the 19th Int’l Conf. on
Web Information Systems Engineering. Dubai: Springer, 2018. 36–51. [doi: 10.1007/978-3-030-02922-7_3]
[13] Li GH, Zhao P, Yuan L, Gao S. Efficient implementation of a multi-dimensional index structure over flash memory storage systems. The
Journal of Supercomputing, 2013, 64(3): 1055–1074. [doi: 10.1007/s11227-011-0679-0]
[14] Liu BZ, Chen L, Zhu XQ, Zhang Y, Zhang CQ, Qiu WD. Protecting location privacy in spatial crowdsourcing using encrypted data.
Advances in Database Technology-EDBT, 2017, 3: 478–481. [doi: 10.5441/002/EDBT.2017.49]
[15] Guttman A. R-trees: A dynamic index structure for spatial searching. In: Proc. of the 1984 ACM SIGMOD Int’l Conf. on Management of
Data. Boston: ACM, 1984. 47–57. [doi: 10.1145/602259.602266]
[16] Qi JZ, Tao YF, Chang YC, Zhang R. Packing R-trees with space-filling curves: Theoretical optimality, empirical efficiency, and bulk-
loading parallelizability. ACM Trans. on Database Systems, 2020, 45(3): 14. [doi: 10.1145/3397506]
[17] Theodoridis Y, Vazirgiannis M, Sellis T. Spatio-temporal indexing for large multimedia applications. In: Proc. of the 3rd IEEE Int’l Conf.
on Multimedia Computing and Systems. Hiroshima: IEEE, 1996. 441–448. [doi: 10.1109/MMCS.1996.535011]
[18] Pfoser D, Jensen CS, Theodoridis Y. Novel approaches in query processing for moving object trajectories. In: Proc. of the 26th Int’l Conf.
on Very Large Data Bases. San Francisco: Morgan Kaufmann Publishers Inc., 2000. 395–406.
[19] Šaltinis S, Jensen CS, Leutenegger ST, López MA. Indexing the positions of continuously moving objects. In: Proc. of the 2000 ACM
SIGMOD Int’l Conf. on Management of Data. Dallas: ACM, 2000. 331–342. [doi: 10.1145/342009.335427]
[20] Tao YF, Papadias D, Sun JM. The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In: Proc. of the 29th
Annual Int’l Conf. on Very Large Data Bases. Berlin: Morgan Kaufmann Publishers Inc., 2003. 790–801. [doi: 10.1016/B978-012722442-
8/50075-6]
[21] Chakka VP, Everspaugh AC, Patel JM. Indexing large trajectory data sets with SETI. In: Proc. of the 2003 CIDR Conf. California:
cidrdb.org, 2003.
[22] Beckmann N, Seeger B. A revised R*-tree in comparison with related index structures. In: Proc. of the 2009 ACM SIGMOD Int’l Conf.
on Management of Data. Providence: ACM, 2009. 799–812. [doi: 10.1145/1559845.1559929]
[23] Alamri S, Taniar D, Nguyen K, Alamri A. C-tree: Efficient cell-based indexing of indoor mobile objects. Journal of Ambient Intelligence
and Humanized Computing, 2020, 11(7): 2841–2857. [doi: 10.1007/S12652-019-01397-W]
[24] Hastings EJ, Mesit J, Guha RK. Optimization of large-scale, real-time simulations by spatial hashing. In: Proc. of the 2005 Summer
Computer Simulation Conf. Berlin: Springer, 2005. 37(4): 9–17.
[25] Ding KM, Zhu CQ, Lu FQ. An adaptive grid partition based perceptual hash algorithm for remote sensing image authentication.
Geomatics and Information Science of Wuhan University, 2015, 40(6): 716–720, 743 (in Chinese with English abstract). [doi: 10.13203/j.
whugis20130567]
[26] Pâris JF, Schwarz T. Merkle hash grids instead of Merkle trees. In: Proc. of the 28th Int’l Symp. on Modeling, Analysis, and Simulation
of Computer and Telecommunication Systems. Nice: IEEE, 2020. 1–8. [doi: 10.1109/MASCOTS50786.2020.9285942]
[27] Kriegel HP, Pötke M, Seidl T. Interval sequences: An object-relational approach to manage spatial data. In: Proc. of the 7th Int’l Symp.
on Spatial and Temporal Databases. Redondo Beach: Springer, 2001. 481–501. [doi: 10.1007/3-540-47724-1_25]
[28] Zhang R, Qi JZ, Stradling M, Huang J. Towards a painless index for spatial objects. ACM Trans. on Database Systems, 2014, 39(3): 19.
[doi: 10.1145/2629333]
[29] Kumar S, Madria S, Linderman M. M-Grid: A distributed framework for multidimensional indexing and querying of location based data.
Distributed and Parallel Databases, 2017, 35(1): 55–81. [doi: 10.1007/s10619-017-7194-0]
[30] Kraska T, Beutel A, Chi EH, Dean J, Polyzotis N. The case for learned index structures. In: Proc. of the 2018 Int’l Conf. on Management
of Data. Houston: ACM, 2018. 489–504. [doi: 10.1145/3183713.3196909]
[31] Wu YJ, Yu J, Tian YY, Sidle R, Barber R. Designing succinct secondary indexing mechanism by exploiting column correlations. In:
Proc. of the 2019 Int’l Conf. on Management of Data. Amsterdam: ACM, 2019. 1223–1240. [doi: 10.1145/3299869.3319861]
[32] Kipf A, Marcus R, van Renen A, Stoian M, Kemper A, Kraska T, Neumann T. RadixSpline: A single-pass learned index. In: Proc. of the
3rd Int’l Workshop on Exploiting Artificial Intelligence Techniques for Data Management. Portland: ACM, 2020. 5. [doi: 10.1145/
3401071.3401659]