Skip to main content
SpringerLink
Log in

Time Responsive External Data Structures for Moving Points

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 2001)

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

Included in the following conference series:

Abstract

We develop external data structures for storing points in one or two dimensions, each moving along a linear trajectory, so that a range query at a given time t q can be answered efficiently. The novel feature of our data structures is that the number of I/Os required to answer a query depends not only on the size of the data set and on the number of points in the answer but also on the difference between t q and the current time; queries close to the current time are answered fast, while queries that are far away in the future or in the past may take more time.

Supported in part by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by NSF grants ITR-333-1050, EIA-9870734, EIA-997287, and CCR-9732787, and by grant from the U.S.-Israeli Binational Science Foundation.

Supported in part by the National Science Foundation through ESS grant EIA-9870734, RI grant EIA-9972879 and CAREER grant EIA-9984099.

Part of this work was done while visiting Duke University.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. P. K. Agarwal, L. Arge, and J. Erickson, Indexing moving points, Proc. Annu. ACM Sympos. Principles Database Syst., 2000, pp. 175–186.

    Google Scholar 

  2. P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J. Vitter, Efficient searching with linear constraints, Journal of Computer and System Sciences, 61 (2000), 194–216.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  4. A. Aggarwal and J. S. Vitter, The Input/Output complexity of sorting and related problems, Communications of the ACM, 31 (1988), 1116–1127.

    Article  MathSciNet  Google Scholar 

  5. L. Arge, External memory data structures, in: Handbook of Massive Data Sets (J. Abello, P. M. Pardalos, and M. G. C. Resende, eds.), Kluwer Academic Publishers, 2001. (To appear).

    Google Scholar 

  6. L. Arge, V. Samoladas, and J. S. Vitter, On two-dimensional indexability and optimal range search indexing, Proc. ACM Symp. Principles of Database Systems, 1999, pp. 346–357.

    Google Scholar 

  7. J. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 747–756.

    Google Scholar 

  8. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, An asymptotically optimal multiversion B-tree, VLDB Journal, 5 (1996), 264–275.

    Article  Google Scholar 

  9. D. Comer, The ubiquitous B-tree, A CM Computing Surveys, 11 (1979), 121–137.

    Article  MATH  Google Scholar 

  10. T. K. Dey, Improved bounds on planar k-sets and related problems, Discrete Comput. Geom., 19 (1998), 373–382.

    Article  MATH  MathSciNet  Google Scholar 

  11. H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications, SIAM J. Comput., 15 (1986), 271–284.

    Article  MATH  MathSciNet  Google Scholar 

  12. L. J. Guibas, Kinetic data structures-a state of the art report, in: Proc. Workshop Algorithmic Found. Robot. (P. K. Agarwal, L. E. Kavraki, and M. Mason, eds.), A. K. Peters, Wellesley, MA, 1998, pp. 191–209.

    Google Scholar 

  13. G. Kollios, D. Gunopulos, and V. J. Tsotras, On indexing mobile objects, Proc. Annu. ACM Sympos. Principles Database Syst., 1999, pp. 261–272.

    Google Scholar 

  14. J. Matousek, Randomized optimal algorithm for slope selection, Inform. Process. Lett., 39 (1991), 183–187.

    Article  MATH  MathSciNet  Google Scholar 

  15. J. Matousek, Efficient partition trees, Discrete Comput. Geom., 8 (1992), 315–334.

    Article  MATH  MathSciNet  Google Scholar 

  16. D. Pfoser, C. S. Jensen, and Y. Theodoridis, Novel approaches to the indexing of moving objects trajectories, Proc. International Conf. on Very Large Databases, 2000, pp. 395–406.

    Google Scholar 

  17. G. Toth, Point sets with many k-sets, Proc. 16th Annu. Symposium on Computational Geometry, 2000, pp. 37–42.

    Google Scholar 

  18. P. J. Varman and R. M. Verma, An efficient multiversion access structure, IEEE Transactions on Knowledge and Data Engineering, 9 (1997), 391–409.

    Article  Google Scholar 

  19. J. S. Vitter, Online data structures in external memory, Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, 1999, pp. 119–133.

    Chapter  Google Scholar 

  20. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, Indexing the positions of continuously moving objects, Proc. ACM SIGMOD International Conference on Management of Data, 2000, pp. 331–342.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC, 27708, USA

    Pankaj K. Agarwal & Lars Arge

  2. Institut für Informatik, Westfälische Wilhelms-Universität Münster, 48149, Münster, Germany

    Jan Vahrenhold

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. Jan Vahrenhold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Candada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. Center for Geometric Computing, Brown University, Providence, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Agarwal, P.K., Arge, L., Vahrenhold, J. (2001). Time Responsive External Data Structures for Moving Points. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44634-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42423-9

  • Online ISBN: 978-3-540-44634-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation