Advertisement

An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments

  • Hyun Kyoo Park
  • Jin Hyun Son
  • Myoung Ho Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2574)

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.

Keywords

Dual Space Index Structure Range Query Query Performance Version Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ross, S.: Stochastic Processes 2nd Ed., John Wiley & Sons (1996)Google Scholar
  2. 2.
    Basch, J., Guibas, L. Hershberger, J.: Data Structures for Mobile Data. Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.(1997) 747–756Google Scholar
  3. 3.
    Bertimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific. (1997)Google Scholar
  4. 4.
    Varman, P., Verma, R.: An Efficient Multiversion Access Structure. IEEE TKDE Vol.9(3) (1997) 391–409Google Scholar
  5. 5.
    Liang, B., Haas, Z.: Predictive Distance-Based Mobility Management for PCS Networks. Proc. of IEEE INFOCOM.(1999) 1377–1384Google Scholar
  6. 6.
    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–287CrossRefGoogle Scholar
  7. 7.
    Agarwal, P., et al.: Efficient Searching with Linear Constraints. J. of Computer and System Sciences. 61. (1999) 194–216CrossRefGoogle Scholar
  8. 8.
    Ramsak, F., et al.: Integrating the UB-Tree into a Database System Kernel. Proc. of VLDB. (2000) 263–272Google Scholar
  9. 9.
    Saltenis, S., et al.: Indexing the Positions of Continuously Moving Objects. Proc. of SIGMOD. (2000) 331–342Google Scholar
  10. 10.
    Wong, V., Leung. V.: Location Management for Next-Generation Personal Communication Networks. IEEE Network 14(5). (2000) 18–24CrossRefGoogle Scholar
  11. 11.
    Tao, Y., Papadias, D., Zhang, J.: Cost Models for Overlapping and Multi-Version Structures. Proc. of ICDE. (2002) 191–200Google Scholar
  12. 12.
    Kollios, G., Gunopulos, D., Tsotras, V., “On Indexing Mobile Objects”, Proc. of PODS, (1999) 262–272Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Hyun Kyoo Park
    • 1
  • Jin Hyun Son
    • 2
  • Myoung Ho Kim
    • 1
  1. 1.Div. of Computer ScienceKorea Advanced Institute of Science and TechnologyYuseong-guSouth Korea
  2. 2.Dept. of Computer Science and EngineeringHanyang UniversityKyunggi-DoSouth Korea

Personalised recommendations