Fig. 1. Example of location based service on road network
Fig. 2. Classification of research dealing with moving objects
Fig. 3. Road network and moving objects (or Points of Interest)
Fig. 4. Network Index Structure and Relationship between Edge and Trajectory
Fig. 7. Data generation by moving object generator
Fig. 5. Insertion algorithm of moving objects
Fig. 6. Edge based trajectory generation algorithm
Table 1. Mobile phone ownership over time
References
- 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. https://doi.org/10.1109/69.755614
- 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.
- 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.
- Roussopoulos, N., Kelley, S., & Vincent, F. (1995). Nearest neighbor queries. In ACM sigmod record, 24(2), 71-79.
- Korea Information Society Development Institute. (2019). Korea Media Panel Survey Contents. KISDI STAT. 19(2). 1-8.
- A. P. Sistla, O. Wolfson, S. Chamberlain & S. Dao. (1997). Modeling and querying moving objects. In icde. (97), 422-432.
- 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.
- M. R. Kolahdouzan & C. Shahab. (2004). Continuous K-Nearest Neighbor Queries in Spatial Network Databases. In STDBM, 33-40.
- 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.
- J. S. Yoo & S. Shekhar. (2005). In-route nearest neighbor queries. GeoInformatica, 9(2), 117-137. https://doi.org/10.1007/s10707-005-6671-1
- R. A. Finkel & J. L. Bentley. (1974). Quad trees a data structure for retrieval on composite keys. Acta informatica, 4(1), 1-9. https://doi.org/10.1007/BF00288933
- J. L. Bentley. (1975). Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 509-517. https://doi.org/10.1145/361002.361007
- A. Guttman. (1984). R-trees: a dynamic index structure for spatial searching. 14(2), 47-57.
- 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.
- T. Brinkhoff. (2002). A framework for generating network-based moving objects. GeoInformatica, 6(2), 153-180. https://doi.org/10.1023/A:1015231126594