Skip to main content
SpringerLink
Log in

Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects

  • Conference paper
Book cover Algorithms – ESA 2004 (ESA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3221))

Included in the following conference series:

Abstract

The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for answering various queries on moving objects, including range and proximity queries, and study tradeoffs between various performance measures—query time, data structure size, and accuracy of results.

Research by the first and fourth authors is supported by NSF under grants CCR-0086013, EIA-9870724, EIA-0131905, and CCR-0204118, and by a grant from the U.S.–Israel Binational Science Foundation. Research by the second author is supported by NSF under grants EIA-9972879, CCR-9984099, EIA-0112849, and INT-0129182. Research by the third author is supported by NSF under grants CCR-0093348, DMR-0121695 and CCR-0219594.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. J. Comput. Syst. Sci. 66, 207–243 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Agarwal, P.K., Arge, L., Vahrenhold, J.: Time responsive external data structures for moving points. In: Proc. 7th Workshop on Algorithms and Data Structures, pp. 50–61 (2001)

    Google Scholar 

  3. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1–56. American Mathematical Society, Providence (1999)

    Google Scholar 

  4. Agarwal, P.K., Gao, J., Guibas, L.: Kinetic medians and kd-trees. In: Proc. 10th European Symposium on Algorithms, pp. 5–16 (2002)

    Google Scholar 

  5. Agarwal, P.K., Guibas, L., Hershberg, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom. 26, 253–274 (2001)

    Google Scholar 

  6. Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Approximating extent measure of points. Journal of the ACM (to appear)

    Google Scholar 

  7. Agarwal, P.K., Procopiuc, C.M.: Advances in indexing for moving objects. IEEE Bulletin of Data Engineering 25, 25–34 (2002)

    Google Scholar 

  8. Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49–119. Elsevier Science Publishers, North-Holland, Amsterdam (2000)

    Chapter  Google Scholar 

  9. Basch, J., Guibas, L., Hershberger, J.: Data structures for mobile data. J. Algorithms 31(1), 1–28 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Brönnimann, H., Chazelle, B.: Optimal slope selection via cuttings. Comp. Geom. Theory & Appl. 10(1), 23–29 (1998)

    MATH  Google Scholar 

  11. Chan, T.M.: Fixed-dimensional linear programming queries made easy. In: Proc. 12th Annu. Sympos. Comput. Geom., pp. 284–290 (1996)

    Google Scholar 

  12. Chan, T.M.: Faster core-set constructions and data stream algorithms in fixed dimensions. In: Proc. 20th Annu. Sympos. Comput. Geom., pp. 152–159 (2004)

    Google Scholar 

  13. Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom. 9, 145–158 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., Stolfi, J.: Lines in space: Combinatorics and algorithms. Algorithmica 15, 428–447 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Czumaj, A., Sohler, C.: Soft kinetic data structures. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pp. 865–872 (2001)

    Google Scholar 

  16. Kollios, G., Gunopulos, D., Tsotras, V.: Nearest neighbor queries in a mobile environment. In: Proc. Intl. Workshop on Spatiotemporal Database Management, pp. 119–134 (1999)

    Google Scholar 

  17. Kollios, G., Gunopulos, D., Tsotras, V.: On indexing mobile objects. In: Proc. ACM Sympos. Principles Database Syst., pp. 261–272 (1999)

    Google Scholar 

  18. Matoušek, J.: Efficient partition trees. Discrete Comput. Geom. 8, 315–334 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  19. Matoušek, J.: Linear optimization queries. J. Algorithms 14, 432–448 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  20. Procopiuc, C.M., Agarwal, P.K., Har-Peled, S.: STAR-tree: an efficient selfadjusting index for moving points. In: Proc 4th Workshop on Algorithms Engineering and Experiments, pp. 178–193 (2002)

    Google Scholar 

  21. Ramos, E.: Linear programming queries revisited. In: Proc. 16th Annu. Sympos. Comput. Geom., pp. 176–181 (2000)

    Google Scholar 

  22. Saltenis, S., Jensen, C., Leutenegger, S., López, M.: Indexing the positions of continuously moving objects. In: Proc. SIGMOD Intl. Conf. Management of Data, pp. 331–342 (2000)

    Google Scholar 

  23. Sarnak, N., Tarjan, R.: Planar point location using persistent search trees. Communications of the ACM 29(7), 669–679 (1986)

    Article  MathSciNet  Google Scholar 

  24. Yu, H., Agarwal, P.K., Poreddy, R., Varadarajan, K.R.: Practical methods for shape fitting and kinetic data structures using core sets. In: Proc. 20th Annu. Sympos. Comput. Geom., pp. 263–272 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Duke University, Durham, NC, 27708-0129, USA

    Pankaj K. Agarwal, Lars Arge & Hai Yu

  2. Department of Computer Science, University of Illinois, Urbana, IL, 61801-2302, USA

    Jeff Erickson

Authors
  1. Pankaj K. Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lars Arge
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeff Erickson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hai Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Freiburg, Georges Köhler Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Department of Computer Science, King’s College, WC2R 2LS, London, UK

    Tomasz Radzik

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Agarwal, P.K., Arge, L., Erickson, J., Yu, H. (2004). Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30140-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23025-0

  • Online ISBN: 978-3-540-30140-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation