Skip to main content
SpringerLink
Log in

Optimal External Memory Planar Point Enclosure

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) such that all K rectangles containing a query point can be reported I/O-efficiently. This problem has important applications in e.g. spatial and temporal databases, and is dual to the important and well-studied orthogonal range searching problem. Surprisingly, despite the fact that the problem can be solved optimally in internal memory with linear space and O(log N+K) query time, we show that one cannot construct a linear sized external memory point enclosure data structure that can be used to answer a query in O(log  B N+K/B) I/Os, where B is the disk block size. To obtain this bound, Ω(N/B 1−ε) disk blocks are needed for some constant ε>0. With linear space, the best obtainable query bound is O(log 2 N+K/B) if a linear output term O(K/B) is desired. To show this we prove a general lower bound on the tradeoff between the size of the data structure and its query cost. We also develop a family of structures with matching space and query bounds.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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. Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Society, Providence (1999)

    Google Scholar 

  2. Agarwal, P.K., de Berg, M., Gudmundsson, J., Hammer, M., Haverkort, H.J.: Box-trees and R-trees with near-optimal query time. In: Proc. ACM Symposium on Computational Geometry, pp. 124–133, 2001

  3. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  4. Arge, L.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313–358. Kluwer Academic, Dordrecht (2002)

    Google Scholar 

  5. Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM J. Comput. 32(6), 1488–1508 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

  7. Arge, L., Danner, A., Teh, S.-H.: I/O-efficient point location using persistent B-trees. ACM J. Exp. Algorithmics (2003)

  8. Arge, L., de Berg, M., Haverkort, H.J., Yi, K.: The priority R-tree: A practically efficient and worst-case optimal R-tree. In: Proc. SIGMOD International Conference on Management of Data, pp. 347–358, 2004

  9. Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion B-tree. VLDB J. 5(4), 264–275 (1996)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Chazelle, B.: Filtering search: a new approach to query-answering. SIAM J. Comput. 15(3), 703–724 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  12. Chazelle, B.: Lower bounds for orthogonal range searching: I. the reporting case. J. ACM 37(2), 200–212 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  13. Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica 1, 133–162 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  14. Comer, D.: The ubiquitous B-tree. ACM Comput. Surv. 11(2), 121–137 (1979)

    Article  MATH  Google Scholar 

  15. de Berg, M., Gudmundsson, J., Hammar, M., Overmars, M.: On R-trees with low stabbing number. In: Proc. European Symposium on Algorithms, pp. 167–178, 2000

  16. Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.: Making data structures persistent. J. Comput. Syst. Sci. 38, 86–124 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  17. Edelsbrunner, H.: A new approach to rectangle intersections. Part I. Int. J. Comput. Math. 13, 209–219 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  18. Fiat, A., Shamir, A.: How to find a battleship. Networks 19, 361–371 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  19. Gaede, V., Günther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170–231 (1998)

    Article  Google Scholar 

  20. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD International Conference on Management of Data, pp. 47–57, 1984

  21. Hellerstein, J.M., Koutsoupias, E., Papadimitriou, C.H.: On the analysis of indexing schemes. In: Proc. ACM Symposium on Principles of Database Systems, pp. 249–256, 1997

  22. Hellerstein, J., Koutsoupias, E., Miranker, D., Papadimitriou, C., Samoladas, V.: On a model of indexability and its bounds for range queries. J. ACM 49(1) (2002)

  23. Kanth, K.V.R., Singh, A.K.: Optimal dynamic range searching in non-replicating index structures. In: Proc. International Conference on Database Theory, pp. 257–276, 1999

  24. Koutsoupias, E., Taylor, D.S.: Tight bounds for 2-dimensional indexing schemes. In: Proc. ACM Symposium on Principles of Database Systems, pp. 52–58, 1998

  25. Matoušek, J.: Geometric Discrepancy. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  26. Samoladas, V., Miranker, D.: A lower bound theorem for indexing schemes and its application to multidimensional range queries. In: Proc. ACM Symposium on Principles of Database Systems, pp. 44–51, 1998

  27. Subramanian, S., Ramaswamy, S.: The P-range tree: A new data structure for range searching in secondary memory. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 378–387, 1995

  28. van den Bercken, J., Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: Proc. International Conference on Very Large Data Bases, pp. 406–415, 1997

Download references

Author information

Authors and Affiliations

  1. MADALGO, Department of Computer Science, University of Aarhus, Aarhus, Denmark

    Lars Arge

  2. Department of Electronics and Computer Engineering, Technical University of Crete, Chania, Greece

    Vasilis Samoladas

  3. Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

    Ke Yi

Authors
  1. Lars Arge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vasilis Samoladas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ke Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ke Yi.

Additional information

An extended abstract of this paper appeared in Proceedings of the 12th European Symposium on Algorithms (ESA’04), Bergen, Norway, September 2004, pp. 40–52.

L. Arge’s research was supported in part by the National Science Foundation through RI grant EIA–9972879, CAREER grant CCR–9984099, ITR grant EIA–0112849, and U.S.-Germany Cooperative Research Program grant INT–0129182, as well as by the US Army Research Office through grant W911NF-04-01-0278, by an Ole Roemer Scholarship from the Danish National Science Research Council, a NABIIT grant from the Danish Strategic Research Council and by the Danish National Research Foundation.

V. Samoladas’ research was supported in part by a grant co-funded by the European Social Fund and National Resources-EPEAEK II-PYTHAGORAS.

K. Yi’s research was supported in part by the National Science Foundation through ITR grant EIA–0112849, U.S.-Germany Cooperative Research Program grant INT–0129182, and Hong Kong Direct Allocation Grant (DAG07/08).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arge, L., Samoladas, V. & Yi, K. Optimal External Memory Planar Point Enclosure. Algorithmica 54, 337–352 (2009). https://doi.org/10.1007/s00453-007-9126-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9126-2

Keywords

Search

Navigation