Index Structure and Trajectory Data Generation Algorithm to Process the Trajectory of Moving Object

이동 객체의 궤적 처리를 위한 색인 구조 및 궤적 데이터 생성 알고리즘

Chae, Cheol-Joo;Kim, Yong-Ki

  • Received : 2019.01.16
  • Accepted : 2019.04.20
  • Published : 2019.04.28


Recently, to support location-based services, there have been many researches which consider the spatial network. For this, there are many experimental data for data processing on the road network. However, the data to process the trajectory of moving objects are not suitable. Therefore, we propose index structure to process the trajectory data on the road network and the trajectory data generation algorithm. In addition, to prove efficiency of our index structure and algorithm, we show that edge-based trajectory data are generated through the proposed algorithm using the map data of San Francisco Bay.


Moving object;Location based service;road network;index structure;trajectory data generation algorithm


  1. S. Shekhar, S. Chawla, S. Ravada, A. Fetterer, X. Liu & C. T. Lu. (1999). Spatial databases-accomplishments and research needs. IEEE transactions on knowledge and data engineering, 11(1), 45-55.
  2. L. Speicvcys, C. S. Jensen & A. Kligys. (2003). Computational data modeling for network-constrained moving objects. In Proceedings of the 11th ACM international symposium on Advances in geographic information systems 118-125.
  3. D. Papadias, J. Zhang, N. Mamoulis & Y. Tao. (2003). Query processing in spatial network databases. In Proceedings of the 29th international conference on Very large data bases, 29, 802-813.
  4. Roussopoulos, N., Kelley, S., & Vincent, F. (1995). Nearest neighbor queries. In ACM sigmod record, 24(2), 71-79.
  5. Korea Information Society Development Institute. (2019). Korea Media Panel Survey Contents. KISDI STAT. 19(2). 1-8.
  6. A. P. Sistla, O. Wolfson, S. Chamberlain & S. Dao. (1997). Modeling and querying moving objects. In icde. (97), 422-432.
  7. C. S. Jensen, T. B. Pedersen, L. Speicys & I. Timko. (2003). Data modeling for mobile services in the real world. In International Symposium on Spatial and Temporal Databases. 1-9.
  8. M. R. Kolahdouzan & C. Shahab. (2004). Continuous K-Nearest Neighbor Queries in Spatial Network Databases. In STDBM, 33-40.
  9. K. Mouratidis, M. L. Yiu, D. Papadias & N. Mamoulis. (2006). Continuous nearest neighbor monitoring in road networks. In Proceedings of the 32nd international conference on Very large data bases, 43-54.
  10. J. S. Yoo & S. Shekhar. (2005). In-route nearest neighbor queries. GeoInformatica, 9(2), 117-137.
  11. R. A. Finkel & J. L. Bentley. (1974). Quad trees a data structure for retrieval on composite keys. Acta informatica, 4(1), 1-9.
  12. J. L. Bentley. (1975). Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 509-517.
  13. A. Guttman. (1984). R-trees: a dynamic index structure for spatial searching. 14(2), 47-57.
  14. Z. Song & N. Roussopoulos. (2003, January). SEB-tree: An approach to index continuously moving objects. In International Conference on Mobile Data Management (pp. 340-344). Springer, Berlin, Heidelberg.
  15. T. Brinkhoff. (2002). A framework for generating network-based moving objects. GeoInformatica, 6(2), 153-180.


Supported by : National Research Foundation of Korea(NRF)