Skip to main content
SpringerLink
Log in

Primal or dual: which promises faster spatiotemporal search?

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

Abstract

The existing predictive spatiotemporal indexes can be classified into two categories, depending on whether they are based on the primal or dual methodology. Although we have gained considerable empirical knowledge about various access methods, currently there is only limited understanding on the theoretical characteristics of the two methodologies. In fact, the experimental results in different papers even contradict each other, regarding the relative superiority of the primal and dual techniques. This paper presents a careful study on the query performance of general primal and dual indexes, and reveals important insight into the behavior of each technique. In particular, we mathematically establish the conditions that determine the superiority of each methodology, and provide rigorous justification for well-known observations that have not been properly explained in the literature. Our analytical findings also resolve the contradiction in the experiments of previous work.

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: PODS, pp. 175–186 (2000)

  2. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322–331 (1990)

  3. Benetis, R., Jensen, C.S., Karciauskas, G., Salteni, S.: Nearest and reverse nearest neighbor queries for moving objects. To appear in VLDB Journal

  4. Berchtold, S., Bohm, C., Keim, D.A., Kriegel, H.-P.: A cost model for nearest neighbor search in high-dimensional data space. In: PODS, pp. 78–86 (1997)

  5. Bruno, N., Chaudhuri, S., Gravano, L.: Stholes: a multidimensional workload-aware histogram. In: SIGMOD, pp. 211–222 (2001)

  6. Elbassioni, K.M., Elmasry, A., Kamel, I.: An efficient indexing scheme for multi-dimensional moving objects. In: ICDT, pp. 425–439 (2003)

  7. Goldstein, J., Ramakrishnan, R., Shaft, U., Yu, J.-B.: Processing queries by linear constraints. In: PODS, pp. 257–267 (1997)

  8. Hellerstein, J.M., Koutsoupias, E., Papadimitriou, C.H.: On the analysis of indexing schemes. In: PODS, pp. 249–256 (1997)

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

    Article  Google Scholar 

  10. Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD, pp. 479–490 (2005)

  11. 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)

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

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

    Article  Google Scholar 

  14. Lee, M.-L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in r-trees: a bottom-up approach. In: VLDB, pp. 608–619 (2003)

  15. Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an analysis of range query performance in spatial data structures. In: PODS, pp. 214–221 (1993)

  16. Patel, J.M., Chen, Y., Chakka, V.P.: Stripes: an efficient index for predicted trajectories. In: SIGMOD, pp. 637–646 (2004)

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

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

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

    Article  Google Scholar 

  20. Theodoridis, Y., Sellis, T.: A model for the prediction of R-tree performance. In: PODS, pp. 161–171 (1996)

  21. Xiong, X., Aref, W.G.: R-trees with update memos. In: ICDE (2006)

  22. Yiu, M., Tao, Y., Mamoulis, N.: The B dual-tree: indexing moving objects by space-filling curves in the dual space. To appear in VLDB Journal

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Chinese University of Hong Kong, New Territories, Hong Kong

    Yufei Tao & Xiaokui Xiao

Authors
  1. Yufei Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaokui Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yufei Tao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tao, Y., Xiao, X. Primal or dual: which promises faster spatiotemporal search?. The VLDB Journal 17, 1253–1270 (2008). https://doi.org/10.1007/s00778-007-0064-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-007-0064-z

Keywords

Search

Navigation