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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: VLDB, pp. 790–801 (2003)
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)
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)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: VLDB, pp. 395–406 (2000)
Kumar, A., Tsotras, V.J., Faloutsos, C.: Designing Access Methods for Bitemporal Databases. TKDE 10(1), 1–20 (1998)
Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: VLDB, pp. 431–440 (2001)
Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-Based Dynamic Attribute Indexing Method. The Computer Journal 41(3), 185–200 (1998)
Papadopoulos, D., Kollios, G., Gunopulos, D., Tsotras, V.J.: Indexing Mobile Objects on the Plane. In: MDDS, pp. 693–697 (2002)
Patel, J.M., Yun, C.V., Chakka, P.: STRIPES: An Efficient Index for Predicted Trajectories. In: ACM SIGMOD, pp. 637–646 (2004)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)