Abstract
Aim at moving objects on road network, we propose a novel indexing named PPFN*-tree to store past trajectories, present positions, and predict near future positions of moving objects. PPFN*-tree is a hybrid indexing structure which consists of a 2D R*-tree managing the road networks, a set of TB*-tree indexing objects’ movement history trajectory along the polylines, and a set of basic HTPR*-tree indexing the position of moving objects after recent update. PPFN*-tree can not only support past trajectory query and present position query, but also support future predictive query. According to the range query time, query in PPFN*-tree can be implemented only in the TB*-tree, or only in the HTPR*-tree, or both of them. Experimental results show that the update performance of the PPFN*-tree is better than that of the PPFI and the RPPF-tree. The query performance of the PPFN*-tree is better than that of the MON-Tree and the PPFI.
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
Pfoser, D.: Indexing the Trajectories of Moving Objects. IEEE Data Engineering Bulletin 25(2), 2–9 (2002)
Kollios, G., Gunopulos, D., Tsotras, V.J.: On indexing mobile objects. In: Proc. of ACM Symp. on Principles of Database Systems (PODS), pp. 261–272 (1999)
Jensen, C.S., Pfoser, D.: Indexing of network constrained moving objects. In: Proc. of the 11th Intl. Symp. on Advances in Geographic Information Systems (2003)
Frentzos, E.: Indexing objects moving on fixed networks. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, pp. 289–305. Springer, Heidelberg (2003)
Victor, T.D.A., Ralf, H.G.: Indexing the Trajectories of Moving Objects in Networks. GeoInformatica 9(1), 33–60 (2005)
Kim, K.-S., Kim, S.-W., Kim, T.-W.: Fast indexing and updating method for moving objects on road networks. In: Proc. of the 4th Intl. Conf. on Web Information Systems Engineering Workshops, pp. 34–42 (2003)
Fang, Y., Cao, J.: Indexing the Past, Present and Future Positions of Moving Objects on Fixed Networks. In: Intl. Conf on Computer Science and Software Engineering, pp. 524–527 (2008)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: Proc. of the 26th Intl. Conf. on Very Large Databases, pp. 395–406 (2000)
Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proceedings of the International Conference on Very Large Databases, VLDB (2001)
Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-Based Dynamic Attribute Indexing Method. The Computer Journal 41(3), 185–200 (1998)
Kollios, G., Gunopulos, D., Tsotras, V.J.: On Indexing Mobile Objects. In: ACM PODS, pp. 261–272 (1999)
Papadopoulos, D., Kollios, G., Gunopulos, D., Tsotras, V.J.: Indexing Mobile Objects on the Plane. In: MDDS, pp. 693–697 (2002)
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 spatiotemporal Access Method for Predictive Queries. In: Proc. of 29th Int. Conf. on Very Large Data Bases, pp. 790–801 (2003)
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)
Fang, Y., Cao, J., Wang, J., Peng, Y., Song, W.: HTPR*-Tree: An Efficient Index for Moving Objects to Support Predictive Query and Partial History Query. In: Wang, L., Jiang, J., Lu, J., Hong, L., Liu, B. (eds.) WAIM 2011. LNCS, vol. 7142, pp. 26–39. Springer, Heidelberg (2012)
Fang, Y., Cao, J., Peng, Y., Chen, N.: Indexing Partial History Trajectory and Future Position of Moving Objects Using HTPR*-Tree. In: Yu, H., Yu, G., Hsu, W., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA Workshops 2012. LNCS, vol. 7240, pp. 229–242. Springer, Heidelberg (2012)
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)
Pelanis, M., Saltenis, S., Jensen, C.S.: Indexing the Past, Present and Anticipated Future Positions of Moving Objects. ACM TODS 31(1), 255–298 (2006)
Fang, Y., Cao, J., Zeng, C., Chen, N.: Indexing the Past, Present and Future Positions of Moving Objects Using PPFI*. In: Proc. of the 8th Intl. Conf. on Networked Computing and Advanced Information Management, pp. 314–320 (2012)
http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generator/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fang, Y., Cao, J., Peng, Y., Chen, N., Liu, L. (2013). Efficient Indexing of the Past, Present and Future Positions of Moving Objects on Road Network. In: Gao, Y., et al. Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39527-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-39527-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39526-0
Online ISBN: 978-3-642-39527-7
eBook Packages: Computer ScienceComputer Science (R0)