Skip to main content
SpringerLink
Log in

Dynamic Range Reporting in External Memory

  • Conference paper
Algorithms and Computation (ISAAC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6507))

Included in the following conference series:

Abstract

In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in \(O(\log_B^2 N + \frac{k}{B})\) I/O operations, where k is the number of points in the answer and B is the block size. Our data structure uses \(O(\frac{N}{B}\log^2_2 N \log^2_2 B)\) blocks of space and supports updates in \(O(\log^3_2 N)\) amortized I/Os. This is the first dynamic data structure that answers three-dimensional range reporting queries in \(\log_B^{O(1)} N + O(\frac{k}{B})\) I/Os.

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.00
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. Afshani, P.: On Dominance Reporting in 3D. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 41–51. Springer, Heidelberg (2008)

    Google Scholar 

  2. Afshani, P., Arge, L., Larsen, K.D.: Orthogonal Range Reporting in Three and Higher Dimensions. In: Proc. FOCS 2009, pp. 149–158 (2009)

    Google Scholar 

  3. Agarwal, P.K., Erickson, J.: Geometric Range Searching and its Relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1–56. AMS Press, Providence (1999)

    Google Scholar 

  4. Aggarwal, A., Vitter, J.S.: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  5. Alstrup, S., Brodal, G.S., Rauhe, T.: New Data Structures for Orthogonal Range Searching. In: Proc. FOCS 2000, pp. 198–207 (2000)

    Google Scholar 

  6. Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: Proc. FOCS 1998, pp. 534–544 (1998)

    Google Scholar 

  7. Arge, L.: External Memory Data Structures. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 1–29. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Arge, L.: The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37, 1–24 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Arge, L., Samoladas, V., Vitter, J.S.: On Two-Dimensional Indexability and Optimal Range Search Indexing. In: Proc. PODS 1999, pp. 346–357 (1999)

    Google Scholar 

  10. Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM J. Comput. 32(6), 1488–1508 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Chazelle, B., Guibas, L.J.: Fractional Cascading: II. Applications. Algorithmica 1(2), 163–191 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57, 37–49 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mortensen, C.W.: Fully Dynamic Orthogonal Range Reporting on RAM. SIAM J. Computing 35(6), 1494–1525 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nekrich, Y.: A Data Structure for Multi-Dimensional Range Reporting. In: Proc. SoCG 2007, pp. 344–353 (2007)

    Google Scholar 

  15. Nekrich, Y.: External Memory Range Reporting on a Grid. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 525–535. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Nekrich, Y.: I/O-Efficient Point Location in a Set of Rectangles. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 687–698. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Nekrich, Y.: Dynamic Range Reporting in External Memory, arXiv: 1006.4093v1

    Google Scholar 

  18. Overmars, M.H.: Efficient Data Structures for Range Searching on a Grid. J. Algorithms 9(2), 254–275 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  19. Pǎtraşcu, M.: (Data) Structures. In: Proc. FOCS 2008, pp. 434-443 (2008)

    Google Scholar 

  20. Pǎtraşcu, M., Thorup, M.: Time-space Trade-offs for Predecessor Search. In: Proc. STOC 2006, pp. 232–240 (2006)

    Google Scholar 

  21. Subramanian, S., Ramaswamy, S.: The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. In: Proc. SODA 1995, pp. 378–387 (1995)

    Google Scholar 

  22. Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys 33(2), 209–271 (2001)

    Article  Google Scholar 

  23. Vengroff, D.E., Vitter, J.S.: Efficient 3-D Range Searching in External Memory. In: Proc. STOC 1996, pp. 192–201 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bonn, Bonn, Germany

    Yakov Nekrich

Authors
  1. Yakov Nekrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, KAIST, Gwahangno 335, Yuseong-gu, 305-701, Daejeon, Korea

    Otfried Cheong  & Kyung-Yong Chwa  & 

  2. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Kunsoo Park

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nekrich, Y. (2010). Dynamic Range Reporting in External Memory. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17514-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17514-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17513-8

  • Online ISBN: 978-3-642-17514-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation