Abstract
The spatio temporal databases concern about the time-varying spatial attributes. And one of the important research areas is tracking and managing moving objects for the location-based services. Many location-aware applications have arisen in various areas including mobile communications, traffic control and military command and control (C2) systems. However, managing exact geometric location information is difficult to be achieved due to continual change of moving objects’ locations.
In this paper we propose the B st-tree that utilizes the concept of multiversion B-trees. It provides an indexing method for future location queries based on the dual transformation. This approach can be applied for the range query on moving object’s trajectories specifically in the mobile communication systems. Also we present a dynamic management algorithm that determines the appropriate update interval probabilistically induced by various mobility patterns to guarantee the query performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ross, S.: Stochastic Processes 2nd Ed., John Wiley & Sons (1996)
Basch, J., Guibas, L. Hershberger, J.: Data Structures for Mobile Data. Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.(1997) 747–756
Bertimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific. (1997)
Varman, P., Verma, R.: An Efficient Multiversion Access Structure. IEEE TKDE Vol.9(3) (1997) 391–409
Liang, B., Haas, Z.: Predictive Distance-Based Mobility Management for PCS Networks. Proc. of IEEE INFOCOM.(1999) 1377–1384
Wolfson, O., Sistla, P., Chamberlain, S., Yesha, Y.: Updating and Querying Databases that Track Mobile Units. J. of Distributed and Parallel Databases. (7). (1999) 257–287
Agarwal, P., et al.: Efficient Searching with Linear Constraints. J. of Computer and System Sciences. 61. (1999) 194–216
Ramsak, F., et al.: Integrating the UB-Tree into a Database System Kernel. Proc. of VLDB. (2000) 263–272
Saltenis, S., et al.: Indexing the Positions of Continuously Moving Objects. Proc. of SIGMOD. (2000) 331–342
Wong, V., Leung. V.: Location Management for Next-Generation Personal Communication Networks. IEEE Network 14(5). (2000) 18–24
Tao, Y., Papadias, D., Zhang, J.: Cost Models for Overlapping and Multi-Version Structures. Proc. of ICDE. (2002) 191–200
Kollios, G., Gunopulos, D., Tsotras, V., “On Indexing Mobile Objects”, Proc. of PODS, (1999) 262–272
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, H.K., Son, J.H., Kim, M.H. (2003). An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments. In: Chen, MS., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds) Mobile Data Management. MDM 2003. Lecture Notes in Computer Science, vol 2574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36389-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-36389-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00393-9
Online ISBN: 978-3-540-36389-7
eBook Packages: Springer Book Archive