External Memory Orthogonal Range Reporting with Fast Updates

  • Yakov Nekrich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7074)

Abstract

In this paper we describe data structures for orthogonal range reporting in external memory that support fast update operations. The query costs either match the query costs of the best previously known data structures or differ by a small multiplicative factor.

Keywords

Data Structure Internal Node Space Usage Query Cost Range Reporting 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 2.
    Afshani, P., Arge, L., Larsen, K.D.: Orthogonal Range Reporting in Three and Higher Dimensions. In: Proc. FOCS, pp. 149–158 (2009)Google Scholar
  3. 3.
    Aggarwal, A., Vitter, J.S.: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM 31(9), 1116–1127 (1988)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Alstrup, S., Brodal, G.S., Rauhe, T.: New Data Structures for Orthogonal Range Searching. In: Proc. FOCS 2000, pp. 198–207 (2000)Google Scholar
  5. 5.
    Arge, L.: The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37, 1–24 (2003)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    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
  7. 7.
    Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM J. Comput. 32(6), 1488–1508 (2003)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Chan, T.: Persistent Predecessor Search and Orthogonal Point Location on the Word RAM. In: Proc. SODA 2011 (2011)Google Scholar
  9. 9.
    Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM J. on Computing 17, 427–462 (1988)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and Related Techniques for Geometry Problems. In: Proc. STOC 1984, pp. 135–143 (1984)Google Scholar
  11. 11.
    Mehlhorn, K., Näher, S.: Dynamic Fractional Cascading. Algorithmica 5, 215–241 (1990)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Mortensen, C.W.: Fully Dynamic Orthogonal Range Reporting on RAM. SIAM J. Computing 35(6), 1494–1525 (2006)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Mortensen, C.W., Pagh, R., Patrascu, M.: On Dynamic Range Reporting in One Dimension. In: Proc. STOC 2005, pp. 104–111 (2005)Google Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    Nekrich, Y.: Dynamic Range Reporting in External Memory. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 25–36. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  16. 16.
    Nekrich, Y.: External Memory Orthogonal Range Reporting with Fast Updates. CoRR abs/1106.6261 (2011)Google Scholar
  17. 17.
    Ramaswamy, S., Subramanian, S.: Path Caching: A Technique for Optimal External Searching. In: Proc. PODS 1994, pp. 25–35 (1994)Google Scholar
  18. 18.
    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
  19. 19.
    Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys 33(2), 209–271 (2001)CrossRefGoogle Scholar
  20. 20.
    Vengroff, D.E., Vitter, J.S.: Efficient 3-D Range Searching in External Memory. In: Proc. STOC 1996, pp. 192–201 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yakov Nekrich
    • 1
  1. 1.Department of Computer ScienceUniversity of ChileChile

Personalised recommendations