원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.7 No.4
2014.07
pp.407-416
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Contrary to MON-tree index less than the temporal and spatial indexing methods based on road networks we proposed Improved-MON-tree. The index is divided into two levels and the quad tree grid index at the top of the road network, and the bottom of the two-dimensional R-tree index moving object moving information. In order to support the global trajectory of moving objects query, add a hash structure underlying index structure connected to the moving object information. Verified by experiment, under certain conditions, Improved-MON-tree than the MON-tree based on edge and routes, has good spatial-temporal window query performance and global trajectory.
목차
Abstract
1. Introduction
2. Network Modeling
2.1. Network Road Model
2.2. Temporal-spatial Data Model
3. Improved-MON-tree Index Structure
3.1. Set up Index
3.2. Query
4. Experimental Analysis
5. Conclusion
Acknowledgements
References
1. Introduction
2. Network Modeling
2.1. Network Road Model
2.2. Temporal-spatial Data Model
3. Improved-MON-tree Index Structure
3.1. Set up Index
3.2. Query
4. Experimental Analysis
5. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보