Skip to main content

HGTPU-Tree: An Improved Index Supporting Similarity Query of Uncertain Moving Objects for Frequent Updates

  • Conference paper
  • First Online:
Advanced Data Mining and Applications (ADMA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11888))

Included in the following conference series:

Abstract

Position uncertainty is one key feature of moving objects. Existing uncertain moving objects indexing technology aims to improve the efficiency of querying. However, when moving objects’ positions update frequently, the existing methods encounter a high update cost. We purpose an index structure for frequent position updates: HGTPU-tree, which decreases cost caused by frequent position updates of moving objects. HGTPU-tree reduces the number of disk I/Os and update costs by using bottom-up update strategy and reducing same group moving objects updates. Furthermore we purpose moving object group partition algorithm STSG (Spatial Trajectory of Similarity Group) and uncertain moving object similar group update algorithm. Experiments show that HGTPU-tree reduces memory cost and increases system stability compared to existing bottom-up indexes. We compared HGTPU-tree with TPU-tree, GTPU-tree and TPU2M-tree. Results prove that HGTPU-tree is superior to other three state-of-the-art index structures in update cost.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Li, J., Wang, B., Wang, G., et al.: A survey of query processing techniques over uncertain mobile objects. J. Front. Comput. Sci. Technol. 7(12), 1057–1072 (2013)

    Google Scholar 

  2. Saltenis, S., Jensen, C.S., Leutenegger, S.T.: Indexing the Positions of Continuously Moving Objects. ACM SIGMOD 2000, Dallas, Texas, USA (2000)

    Google Scholar 

  3. Li, B., et al.: Algorithm, reverse furthest neighbor querying, of moving objects. In: ADMA 2016, Gold Coast, QLD, Australia, pp. 266–279 (2016)

    Google Scholar 

  4. Güting, R.H., Schneider, M.: Moving Objects Databases, pp. 220–268. Elsevier (2005)

    Google Scholar 

  5. Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: an optimized spatio-temporal access method for predictive queries. In: VLDB, pp. 790–801 (2003)

    Chapter  Google Scholar 

  6. Procopiuc, Cecilia M., Agarwal, Pankaj K., Har-Peled, S.: STAR-tree: an efficient self-adjusting index for moving objects. In: Mount, David M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 178–193. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45643-0_14

    Chapter  Google Scholar 

  7. Saltenis, S., Jensen, C.S.: Indexing of moving objects for location-based services. In: ICDE, p. 0463 (2002)

    Google Scholar 

  8. Fang, Y., Cao, J., Peng, Y., Chen, N., Liu, L.: Efficient indexing of the past, present and future positions of moving objects on road network. In: Gao, Y., Shim, K., Ding, Z., Jin, P., Ren, Z., Xiao, Y., Liu, A., Qiao, S. (eds.) WAIM 2013. LNCS, vol. 7901, pp. 223–235. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39527-7_23

    Chapter  Google Scholar 

  9. Pelanis, M., Saltenis, S., Jensen, C.S.: Indexing the past, present, and anticipated future positions of moving objects. ACM Trans. Database Syst. (TODS) 31(1), 255–298 (2006)

    Article  Google Scholar 

  10. Lee, M.L., Hsu, W., Jensen, C.S., et al.: Supporting frequent updates in R-trees: a bottom-up approach. In: Proceedings of the 29th International Conference on Very large data bases-Volume 29. VLDB Endowment, pp. 608–619 (2003)

    Chapter  Google Scholar 

  11. Qi, J., Tao, Y., Chang, Y., Zhang, R.: Theoretically optimal and empirically efficient r-trees with strong parallelizability. Proc. VLDB Endowment (PVLDB) 11(5), 621–634 (2018)

    Google Scholar 

  12. Tao, Y., Cheng, R., Xiao, X., et al.: Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proceedings of 31st International Conference, VLDB 2005, pp. 922–933. Morgan Kaufmann Publishers, Inc. (2005)

    Google Scholar 

  13. Ding, X., Lu, Y., Pan, P., et al.: U-Tree based indexing method for uncertain moving objects. J. Softw. 19(10), 2696–2705 (2008)

    Article  Google Scholar 

  14. Ding, X.F., Jin, H., Zhao, N.: Indexing of uncertain moving objects with frequent updates. Chin. J. Comput. 35(12), 2587–2597 (2012)

    Article  Google Scholar 

  15. Sadahiro, Y., Lay, R., Kobayashi, T.: Trajectories of moving objects on a network: detection of similarities, visualization of relations, and classification of trajectories. Trans. GIS 17(1), 18–40 (2013)

    Article  Google Scholar 

  16. Ra, M., Lim, C., Song, Y.H., Jung, J., Kim, W.-Y.: Effective trajectory similarity measure for moving objects in real-world scene. In: Kim, Kuinam J. (ed.) Information Science and Applications. LNEE, vol. 339, pp. 641–648. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46578-3_75

    Chapter  Google Scholar 

  17. Stamatakos, M., Douzinas, E., Stefanaki, C., et al.: Gastrointestinal stromal tumor. World J. Surg. Oncol. 7(1), 61 (2009)

    Article  Google Scholar 

  18. Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world. In: Proceedings of the KDD, pp. 316–324 (2011)

    Google Scholar 

  19. Yuan, J., et al.: T-drive: Driving directions based on taxi trajectories. In: Proceedings of the GIS, pp. 99–108 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Mengqian Zhang or Bohan Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, M., Li, B., Wang, K. (2019). HGTPU-Tree: An Improved Index Supporting Similarity Query of Uncertain Moving Objects for Frequent Updates. In: Li, J., Wang, S., Qin, S., Li, X., Wang, S. (eds) Advanced Data Mining and Applications. ADMA 2019. Lecture Notes in Computer Science(), vol 11888. Springer, Cham. https://doi.org/10.1007/978-3-030-35231-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-35231-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-35230-1

  • Online ISBN: 978-3-030-35231-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics