Skip to main content
SpringerLink
Log in

The B dual-Tree: indexing moving objects by space filling curves in the dual space

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the B x-tree (the state-of-the-art), which consists of multiple B +-trees indexing the 1D values transformed from the (multi-dimensional) moving objects based on a space filling curve (Hilbert, in particular). This curve, however, does not consider object velocities, and as a result, query processing with a B x-tree retrieves a large number of false hits, which seriously compromises its efficiency. It is natural to wonder “can we obtain better performance by capturing also the velocity information, using a Hilbert curve of a higher dimensionality?”. This paper provides a positive answer by developing the B dual-tree, a novel spatiotemporal access method leveraging pure relational methodology. We show, with theoretical evidence, that the B dual-tree indeed outperforms the B x-tree in most circum- stances. Furthermore, our technique can effectively answer progressive spatiotemporal queries, which are poorly supported by B x-trees.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. In: Proceedings of the 19th ACMPODS symposium on principles of database systems PODS pp. 175–186 (2000)

  2. Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects In: Proceedings of the international database engineering and applications symposium, pp. 44–53 (2002)

  3. Butz A.R. (1971): Alternative algorithm for Hilbert’s space-filling curve. IEEE Trans. Comput. C-20(4): 424–426

    Article  Google Scholar 

  4. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACMSIGMOD conference on management of data 47–57 (1984)

  5. Hjaltason G.R., Samet H. (1999): Distance browsing in spatial databases. TODS 24(2): 265–318

    Article  Google Scholar 

  6. Jensen, C.S., Lin, D., Ooi, B.C.: Query and update efficient B+-tree based indexing of moving objects. VLDB 768–779 (2004)

  7. Kollios, G., Gunopulos, D., Tsotras, V.J.: On indexing mobile objects. PODS 261–272 (1999)

  8. Kollios G., Papadopoulos D., Gunopulos D., Tsotras V.J. (2005): Indexing mobile objects using dual transformations. VLDB J. 14(2): 238–256

    Article  Google Scholar 

  9. Lin, D., Jensen, C.S., Saltenis, S., Ooi, B.C.: Efficient indexing of the historical, present, and future positions of moving objects. In: Proceedings of the 6th International conference on mobile data management, pp. 59–66 (2005)

  10. Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: Scalable incremental processing of continuous queries in spatio-temporal databases. SIGMOD (2004)

  11. Moon B., Jagadish H.V., Faloutsos C., Saltz J.H. (2001): Analysis of the clustering properties of the Hilbert space-filling curve. TKDE 13(1): 124–141

    Google Scholar 

  12. Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: Proceedings of the ACM conference on management of data, pp. 635–646 SIGMOD (2005)

  13. Patel, J.M., Chen, Y., Chakka, V.P.: STRIPES: an efficient index for predicted trajectories. In: Proceedings of SIGMOD, 637–646 (2004)

  14. Pemmaraju S.V., Shaffer C.A. (1994): Analysis of the worst case space complexity of a PR quadtree. Inf. Process. Lett. 49(5): 263–267

    Article  MATH  MathSciNet  Google Scholar 

  15. Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: Proceedings of the ACM SIGMOD, pp. 331–342 (2000)

  16. Tao, Y., Papadias, D., Sun, J.: The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In: Proceedings of the international conference on very large data bases pp. 790–801 (2003)

  17. Tao Y., Sun J., Papadias D. (2003): Analysis of predictive spatio-temporal queries. TODS 28(4): 295–336

    Article  Google Scholar 

  18. Theodoridis, Y., Sellis, T.K.: A model for the prediction of R-tree performance. In: Proceedings of the symposium on principles of database systems pp. 161–171 (1996)

  19. Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.L.: Location-based spatial queries. In: Proceedings of the 18th ACM SIGMOD conference pp.443–454 (2003)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong, China

    Man Lung Yiu

  2. Department of Computer Science and Engineering, Chinese University of Hong Kong, Sha Tin, New Territories, Hong Kong, China

    Yufei Tao

  3. Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong, China

    Nikos Mamoulis

Authors
  1. Man Lung Yiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yufei Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikos Mamoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Man Lung Yiu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yiu, M.L., Tao, Y. & Mamoulis, N. The B dual-Tree: indexing moving objects by space filling curves in the dual space. The VLDB Journal 17, 379–400 (2008). https://doi.org/10.1007/s00778-006-0013-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-006-0013-2

Keywords

Search

Navigation