Browse > Article

A Multiversion-Based Spatiotemporal Indexing Mechanism for the Efficient Location-based Services  

박현규 (한국과학기술원 전자전산학과)
손진현 (한양대학교 컴퓨터공학과)
김명호 (한국과학기술원 전산학과)
Publication Information
Journal of KIISE:Databases / v.30, no.1, 2003 , pp. 41-51 More about this Journal
Abstract
The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.
Keywords
Spatiotemporal Database; Multi-version Structure; Indexing; Location-Based Service; Moving Object;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Bar-Noy, A., Kessler, I., Sidi, M., 'Mobile Users: To Update or not to update', J. of Wireless Networks, 1(2), pp. 175-185, July, 1995   DOI
2 Agarwal, P., Erickson, J, 'Geometric Range Searching and Its Relatives', Advances in Discrete and Comput. Geom. (B. Chazelle et al., eds.), American Mathematical Society, Providence, 1998
3 Wong, V., Leung, V., 'Location Management for Next-Generation Personal Communication Networks', IEEE Network, Vol. 14(5), pp. 18-24, 2000   DOI   ScienceOn
4 Markl, V., Zirkel, M., Bayer, R., 'Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm', Proceeding of ICDE, pp. 562-571, 1999   DOI
5 Saltenis, S., Jensen, C., Leutenegger, S., Lopez, M., 'Indexing the Positions of Continuously Moving Objects', Proceedings of SIGMOD, pp. 331-342, 2000   DOI   ScienceOn
6 Basch, J., Guibas, L. Hershberger, J., 'Data Structures for Mobile Data', Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.747-756, 1997
7 Agarwal, P., et al., 'Efficient Searching with Linear Constraints', J. of Computer and System Sciences 61, pp. 194-216, 2000   DOI   ScienceOn
8 Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P., 'An Asymptotically Optimal Multiversion B-tree', VLDB Journal 5(4), pp. 264-275, 1996   DOI
9 Varman, P., Verma, R., 'An Efficient Multiversion Access Structure', IEEE TKDE, Vol. 9, No. 3, pp. 391-409, 1997   DOI   ScienceOn
10 Tao, Y., Papadis, D., Zhang, J., 'Cost Models for Overlapping and Multi-Version Structures', Proceedings of ICDE, pp. 191-200, 2002   DOI
11 Bertimas, D., Tsitsiklis, J., Introduction to Linear Optimization, Athena Scientific, 1997
12 Kollios, G., Gunopulos, D., Tsotras, V., 'On Indexing Mobile Objects', Proceedings of PODS 99, pp. 262-272, 1999   DOI
13 Liang, B., Haas, Z., 'Predictive Distance-Based Mobility Management for PCS Networks', Proceedings of IEEE INFOCOM, Vol. 3, pp. 1377-1384, 1999   DOI
14 Wolfson, O., Sistla, P., Chamberlain, S., Yesha, Y., 'Updating and Querying Databases that track Mobile Units', J. of Distributed and Parallel Databases, Vol. 7, pp257-287, 1999   DOI
15 Ramsak, F. et al., 'Integrating the UB-Tree into a Database System Kernel', Proceedings of VLDB, pp263-272, 2000
16 Ross, S., Stochastic Processes, 2nd Ed., John Wiley & Sons, 1996
17 Theodoridis, Y., Nascimento, M., 'Generating Spatiotemporal Datasets on the WWW', SIGMOD Record 29(3), pp. 39-43, 2000   DOI
18 Saltenis, S., Jensen, C., 'Indexing of Moving Objects for Location-Based Services', Proceedings of ICDE, pp. 463-472, 2002   DOI