Skip to main content
SpringerLink
Log in

Recent Advances in Worst-Case Efficient Range Search Indexing

(Invited Talk)

  • Conference paper
Advances in Spatial and Temporal Databases (SSTD 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5644))

Included in the following conference series:

Abstract

Range search indexing is the problem of storing a set of data points on disk such that the points in a axis-parallel (hyper-) query rectangle can be found efficiently (with as few disk accesses - or I/Os - as possible). The problem is arguably one of the most fundamental problems in spatial databases. Many indexes have been proposed for the problem and its variants.The R-tree for example can be used to solve the more general version of the problem where the data is rectangles.

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

References

  1. 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)

    Google Scholar 

  2. 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 Publishers, Dordrecht (2002)

    Chapter  Google Scholar 

  3. Arge, L.: The buffer tree: A technique for designing batched external data structures. Algorithmica 37(1), 1–24 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Arge, L., Danner, A., Teh, S.-H.: I/O-efficient point location using persistent B-trees. In: Proc. Workshop on Algorithm Engineering and Experimentation (2003)

    Google Scholar 

  5. 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)

    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)

    Google Scholar 

  7. Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM Journal on Computing 32(6), 1488–1508 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Chapter  Google Scholar 

  14. Procopiuc, O., Agarwal, P.K., Arge, L., Vitter, J.S.: Bkd-tree: A dynamic scalable kd-tree. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Google Scholar 

  16. 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)

    Google Scholar 

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

    Article  Google Scholar 

  18. Vitter, J.S.: External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys 33(2), 209–271 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Lars Arge

Authors
  1. Lars Arge
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong, China

    Nikos Mamoulis

  2. Data management and exploration group, Department of Computer Science, RWTH Aachen University, 52056, Aachen, Germany

    Thomas Seidl

  3. Department of Computer Science, Aalborg University, Selma Lagerlöfsvej 300, DK-9220, Aalborg Ø,, Denmark

    Torben Bach Pedersen  & Kristian Torp  & 

  4. Department of Computer Science, Aalborg University, Selma Lagerlöfsvej 300, DK-9220, Aalborg Ø, Denmark

    Ira Assent

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arge, L. (2009). Recent Advances in Worst-Case Efficient Range Search Indexing. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02982-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02981-3

  • Online ISBN: 978-3-642-02982-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation