Skip to main content

VTPR-Tree: An Efficient Indexing Method for Moving Objects with Frequent Updates

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNCS,volume 4231)

Abstract

Moving object databases are required to support queries on a large number of continuous moving objects. Indexes for moving objects must support both query and update operations efficiently. In previous work TPR-tree is the most popular indexing method for the future predicted position, but its frequent updates performance is very poor. In this paper we propose a novel indexing method, called VTPR-tree, for predicted trajectory of moving objects. VTPR-tree takes into account both the velocity and space distribution of moving objects. First the velocity domain is split, and moving objects are classified into different velocity buckets by their velocities, thus objects in one bucket have similar velocities. Then we use an improved TPR-tree structure to index objects in each bucket. VTPR-tree is supplemented by a hash index on IDs of moving objects to support frequent updates. Also an extended bottom-up update algorithm is developed for VTPR-tree, thus having a good dynamic update performance and concurrency. Experimental results show that the update and query performance of VTPR-tree outperforms the TPR*-tree.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11908883_15
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47704-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B+-tree Based Indexing of Moving Objects. In: Proc. VLDB Conf. (2004)

    Google Scholar 

  2. Saltenis, S., Jensen, C.S., et al.: Indexing the Positions of Continuously Moving Objects. In: Proc. SIGMOD Conf., pp. 331–342 (2000)

    Google Scholar 

  3. Mokbel, M.F., Ghanem, T.M.: Spatio-temporal Access Methods. IEEE Data Engineering Bulletin (2003)

    Google Scholar 

  4. Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: Proc. VLDB Conf., pp. 790–801 (2003)

    Google Scholar 

  5. Lee, M., Hsu, W., Jensen, C., Cui, B., Teo, K.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: Proc. VLDB Conf. (2003)

    Google Scholar 

  6. Lin, B., Su, J.: On bulk loading TPR-tree. In: Proc. IEEE Conf. Mobile Data Management, pp. 114–124 (2004)

    Google Scholar 

  7. Brinkhoff, T.: A Framework for Generating Network-Based Moving Objects. GeoInformatica 6(2), 153–180 (2002)

    MATH  CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liao, W., Tang, G., Jing, N., Zhong, Z. (2006). VTPR-Tree: An Efficient Indexing Method for Moving Objects with Frequent Updates. In: , et al. Advances in Conceptual Modeling - Theory and Practice. ER 2006. Lecture Notes in Computer Science, vol 4231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908883_15

Download citation

  • DOI: https://doi.org/10.1007/11908883_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47703-7

  • Online ISBN: 978-3-540-47704-4

  • eBook Packages: Computer ScienceComputer Science (R0)