[1] 章登义,李想.一种基于密度网格索引的k-最近邻查询算法[J].电子学报,2017,45(2):376-383. Zhang D Y,Li X.A k-nearest neighbor query algorithm for density grid-based index[J].Acta Electronica Sinica,2017,45(2):376-383.(in Chinese). [2] 李灿,钱江波,等.M2LSH:基于 LSH 的高维数据近似最近邻查找算法[J].电子学报,2017,45(6):1431-1442. Li C,Qian J B,et al.M2LSH:An LSH based technique for approximate nearest neighbor searching on high dimensional data[J].Acta Electronica Sinica,2017,45(6):1431-1442.(in Chinese). [3] 梁俊杰,李凤华,等.MapReduce 框架下的优化高维索引与KNN 查询[J].电子学报,2016,44(8):1873-1880. Liang J J,Li F H,et al.Optimized high-dimensional index and KNN query in mapreduce[J].Acta Electronica Sinica,2016,44(8):1873-1880.(in Chinese). [4] Guttman A.R-trees:A dynamic index structure for spatial searching[A].ACM SIGMOD International Conference on Management of Data[C].New York,USA:ACM,1984.47-57. [5] Leutenegger S T,Lopez M A,Edgington J.STR:A simple and efficient algorithm for R-tree packing[A].Proceedings of the 13th International Conference on Data Engineering[C].Piscataway,USA:IEEE,1997.497-506. [6] Theodoridis Y,Vazirgiannis M,Sellis T.Spatio-temporal indexing for large multimedia applications[A].Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems[C].Piscataway,USA:IEEE,1996.441-448. [7] Pfoser D,Jensen C S,Theodoridis Y.Novel approaches to the indexing of moving object trajectories[A].VLDB[C].San Francisco,USA:Morgan Kaufmann,2000.395-406. [8] Nascimento M A,Silva J R O.Towards historical R-trees[A].Proceedings of the 1998 ACM Symposium on Applied Computing[C].New York,USA:ACM,1998.235-240. [9] Tao Y,Papadias D.MV3R-Tree:A spatio-temporal access method for timestamp and interval queries[A].VLDB[C].San Francisco,USA:Morgan Kaufmann,2001.431-440. [10] Chakka V P,Everspaugh A C,Patel J M.Indexing large trajectory data sets with SETI[J].Ann Arbor,2003,1001(48109-2122):12. [11] Wang L,Zheng Y,Xie X,et al.A flexible spatio-temporal indexing scheme for large-scale GPS track retrieval[A].Proceedings of the 9th International Conference on Mobile Data Management(MDM'08)[C].Piscataway,USA:IEEE,2008.1-8. [12] 李斌,郭景维,彭骞.面向大数据存储的 HBase二级索引设计[J].计算技术与自动化,2019,(2):23. Li B,Guo J W,Peng Q.Design of Hbase secondary indexes for big data storage[J].Computing Technology and Automation,2019,(2):23.(in Chinese). [13] Wang L,Cai R,Fu T Z J,et al.Waterwheel:Realtime indexing and temporal range query processing over massive data streams[A].Proceedings of IEEE 34th International Conference on Data Engineering (ICDE)[C].Piscataway,USA:IEEE,2018.269-280. [14] 王智广,申思,鲁强.一种用于交通轨迹数据的时空R树索引结构[J].内蒙古大学学报(自然科学版),2019,50(03):317-323. Wang Z G,Shen S,Lu Q.An index structure about spatio-temporal R-tree for traffic trajectory data[J].Journal of Inner Mongolia University(Natural Science Edition),2019,50(03):317-323.(in Chinese). [15] 赵馨逸,黄向东,等.基于不均匀空间划分和R树的时空索引[J].计算机研究与发展,2019,56(3):666-676. Zhao X Y,Huang X D,et al.A spatio-temporal index based on skew spatial coding and R-tree[J].Journal of Computer Research and Development,2019,56(3):666-676.(in Chinese). [16] Hoare C A R.Algorithm 64:Quicksort[J].Communication of the ACM,1961,4(7):321. [17] Christian D,Behr T,Ralf H G.BerlinMOD:A benchmark for moving object databases[J].VLDB Journal,2009,18(6):1335-1368. |