A Moving Object Spatial Index for Spatio-Temporal Data Stream

被引:0
|
作者
Yang L.-H. [1 ]
Shen D.-H. [1 ]
Fan Y.-L. [1 ]
Gao N. [1 ]
机构
[1] School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou
来源
关键词
Moving object; Object aggregation; R-tree; Spatial index; Spatio-temporal data stream;
D O I
10.12263/DZXB.20200300
中图分类号
学科分类号
摘要
In light of the characteristics of spatio-temporal data stream, we propose a moving object spatial index construction method called HSTRCL, which is based on time window data sorting and bulk loading. It segments the continuous spatio-temporal data stream with fixed-length time windows; after finishing caching the data of a time window, by combining parallel processing and optimized bulk loading technology, we isolate as much as possible the time-consuming work of data partitioning and sorting operations from the traditional build process, and parallize them with the reception of data streams and other build operations. Furthermore, we avoid unnecessary locking synchronization overhead. And all these techniques improve the efficiency of index construction. In addition, to meet the performance and diverse query requirements, we also adopt the primary-auxiliary index construction technology based on Hash and STR. To further improve the performance in the object query scenario, we invent another moving object spatial index construction method OAHSTRCL via time window object aggregation and bulk loading, where objects are divided more finely, and the object query time required is about 65% of HSTRCL, though it will affect the performance of spatial query to some extent. Theoretical analysis and experiments have demonstrated the effectiveness of our proposed methods. © 2021, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码:992 / 1000
页数:8
相关论文
共 17 条
  • [1] Zhang D Y, Li X., A k-nearest neighbor query algorithm for density grid-based index, Acta Electronica Sinica, 45, 2, pp. 376-383, (2017)
  • [2] Li C, Qian J B, Et al., M2LSH: An LSH based technique for approximate nearest neighbor searching on high dimensional data, Acta Electronica Sinica, 45, 6, pp. 1431-1442, (2017)
  • [3] Liang J J, Li F H, Et al., Optimized high-dimensional index and KNN query in mapreduce, Acta Electronica Sinica, 44, 8, pp. 1873-1880, (2016)
  • [4] Guttman A., R-trees: A dynamic index structure for spatial searching, ACM SIGMOD International Conference on Management of Data, pp. 47-57, (1984)
  • [5] Leutenegger S T, Lopez M A, Edgington J., STR: A simple and efficient algorithm for R-tree packing, Proceedings of the 13th International Conference on Data Engineering, pp. 497-506, (1997)
  • [6] Theodoridis Y, Vazirgiannis M, Sellis T., Spatio-temporal indexing for large multimedia applications, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems, pp. 441-448, (1996)
  • [7] Pfoser D, Jensen C S, Theodoridis Y., Novel approaches to the indexing of moving object trajectories, VLDB, pp. 395-406, (2000)
  • [8] Nascimento M A, Silva J R O., Towards historical R-trees, Proceedings of the 1998 ACM Symposium on Applied Computing, pp. 235-240, (1998)
  • [9] Tao Y, Papadias D., MV3R-Tree: A spatio-temporal access method for timestamp and interval queries, VLDB, pp. 431-440, (2001)
  • [10] Chakka V P, Everspaugh A C, Patel J M., Indexing large trajectory data sets with SETI, Ann Arbor, 1001, 48109-2122, (2003)