Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2003: Algorithms - ESA 2003 pp 7–18Cite as

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

  • Conference paper

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

Abstract

We develop several linear or near-linear space and I/O-efficient dynamic data structures for orthogonal range-max queries and stabbing-max queries. Given a set of N weighted points in ℝd, the range-max problem asks for the maximum-weight point in a query hyper-rectangle. In the dual stabbing-max problem, we are given N weighted hyper-rectangles, and we wish to find the maximum-weight rectangle containing a query point. Our structures improve on previous structures in several important ways.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Arge, L., Brodal, G.S., Vitter, J.S.: I/O-efficient dynamic point location in monotone planar subdivisions. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 1116–1127 (1999)

    Google Scholar 

  2. Agarwal, P.K., Arge, L., Govindarajan, S.: CRB-tree: An optimal indexing scheme for 2D aggregate queries. In: Proc. Intl. Conf. on Database Theory (2003)

    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. Aggarwal, A., Vitter, J.S.: The Input/Output complexity of sorting and related problems. Comm. ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  5. Arge, L.: External memory data structures. In: Handbook of Massive Data Sets, pp. 313–358. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  6. Arge, L., Vahrenhold, J.: I/O-efficient dynamic planar point location. In: Proc. ACM Symp. on Computational Geometry, pp. 191–200 (2000)

    Google Scholar 

  7. Arge, L., Vitter, J.S.: Optimal dynamic interval management in external memory. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 560–569 (1996)

    Google Scholar 

  8. Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informatica 1, 173–189 (1972)

    Article  Google Scholar 

  9. Bentley, J.L.: Multidimensional divide and conquer. Comm. ACM 23(6), 214–229 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3), 427–462 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Comer, D.: The ubiquitous B-tree. ACM Computing Surveys 11(2), 121–137 (1979)

    Article  MATH  Google Scholar 

  12. Edelsbrunner, H., Maurer, H.A.: On the intersection of orthogonal objects. Information Processing Letters 13, 177–181 (1981)

    Article  MathSciNet  Google Scholar 

  13. Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170–231 (1998)

    Article  Google Scholar 

  14. Grossi, R., Italiano, G.F.: Efficient cross-tree for external memory. In: External Memory Algorithms and Visualization. AMS, DIMACS series in Discrete Mathematics and Theoretical Computer Science, pp. 87–106 (1999)

    Google Scholar 

  15. Kanth, K.V.R., Singh, A.K.: Optimal dynamic range searching in nonreplicating index structures. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 257–276. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  16. Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic rectangular intersection with priorities. In: Proc. ACM Symp. on Theory of Computation, pp. 639–648 (2003)

    Google Scholar 

  17. Overmars, M.: The Design of Dynamic Data Structures. LNCS, vol. 156. Springer, Heidelberg (1983)

    MATH  Google Scholar 

  18. Robinson, J.: The K-D-B tree: A search structure for large multidimensional dynamic indexes. In: Proc. SIGMOD Intl. Conf. on Management of Data, pp. 10–18 (1981)

    Google Scholar 

  19. Vuillemin, J.: A unifying look at data structures. Comm. ACM 23, 229–239 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  20. Yang, J., Widom, J.: Incremental computation and maintenance of temporal aggregates. In: Proc. IEEE Intl. Conf. on Data Engineering, pp. 51–60 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Pankaj K. Agarwal, Lars Arge, Jun Yang & Ke Yi

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. Jun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ke Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università degli Studi “Roma Tre”, via della Vasca Navale 79, 00146, Rome, Italy

    Giuseppe Di Battista

  2. School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Uri Zwick

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Agarwal, P.K., Arge, L., Yang, J., Yi, K. (2003). I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39658-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20064-2

  • Online ISBN: 978-3-540-39658-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation