Skip to main content

Indexing Partial History Trajectory and Future Position of Moving Objects Using HTPR*-Tree

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7240))

Included in the following conference series:

Abstract

Currently, most indexing methods of moving objects are focused on the past position, or the present and future one. In this paper, we propose a novel indexing method, called History TPR*-tree(HTPR*-tree), which not only supports predictive queries but also partial history ones involved from the most recent update instant of each object to the last update time of all objects. Based on the TPR*-tree, our Basic HTPR*-tree adds creation or update time of moving objects to leaf node entries. In order to improve the update performance, we present a bottom-up update strategy for the HTPR*-tree by supplementing a hash table, a bit vector and a direct access table. Experimental results show that the update performance of the HTPR*-tree is better than that of the Basic HTPR*-and TPR*-tree. In addition to support partial history queries, the update and predictive query performance of the HTPR*-tree are greatly improved compared with those of the RPPF-tree.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Pelanis, M., Saltenis, S., Jensen, C.S.: Indexing the Past, Present and Anticipated Future Positions of Moving Objects. In: ACM TODS, pp. 255–298 (2006)

    Google Scholar 

  2. Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: ACM SIGMOD, pp. 331–342 (2000)

    Google Scholar 

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

    Google Scholar 

  4. Lee, M., Hsu, W., Jensen, C.S., Cui, B., Teo, K.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: VLDB, pp. 608–619 (2003)

    Google Scholar 

  5. Liao, W., Tang, G.F., Jing, N., Zhong, Z.N.: Hybrid Indexing of Moving Objects Based on Velocity. Distribution, Chinese Journal of Computers 30(4) (2007)

    Google Scholar 

  6. Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: VLDB, pp. 395–406 (2000)

    Google Scholar 

  7. Kumar, A., Tsotras, V.J., Faloutsos, C.: Designing Access Methods for Bitemporal Databases. TKDE 10(1), 1–20 (1998)

    Google Scholar 

  8. Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: VLDB, pp. 431–440 (2001)

    Google Scholar 

  9. Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-Based Dynamic Attribute Indexing Method. The Computer Journal 41(3), 185–200 (1998)

    Article  MATH  Google Scholar 

  10. Papadopoulos, D., Kollios, G., Gunopulos, D., Tsotras, V.J.: Indexing Mobile Objects on the Plane. In: MDDS, pp. 693–697 (2002)

    Google Scholar 

  11. Patel, J.M., Yun, C.V., Chakka, P.: STRIPES: An Efficient Index for Predicted Trajectories. In: ACM SIGMOD, pp. 637–646 (2004)

    Google Scholar 

  12. Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In: VLDB, pp. 768–779 (2004)

    Google Scholar 

  13. Chen, S., Ooi, B.C., Tan, K.L., Nacismento, M.: ST2B-tree: A Self-Tunable Spatio-Temporal B+-tree Index for Moving Objects. In: ACM SIGMOD, pp. 29–42 (2008)

    Google Scholar 

  14. Sun, J., Papadias, D., Tao, Y., Liu, B.: Querying about the Past, the Present and the Future in Spatio-Temporal Databases. In: ICDE, pp. 202–213 (2004)

    Google Scholar 

  15. Lin, D., Jensen, C.S., Ooi, B.C., Saltenis, S.: Efficient Indexing of the Historical, Present, and Future Positions of Moving Objects. In: MDM, pp. 59–66 (2005)

    Google Scholar 

  16. http://www.census.gov/geo/www/tiger

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, Y., Cao, J., Peng, Y., Chen, N. (2012). Indexing Partial History Trajectory and Future Position of Moving Objects Using HTPR*-Tree. In: Yu, H., Yu, G., Hsu, W., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29023-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29023-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29022-0

  • Online ISBN: 978-3-642-29023-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics