Skip to main content

A Simple Data Structure for Optimal Two-Sided 2D Orthogonal Range Queries

  • Conference paper
  • First Online:
  • 681 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11529))

Abstract

Given an arbitrary set A of two-dimensional points over a totally-ordered domain, a two-sided planar range query consists on finding all points of A within an arbitrary quadrant. In this paper we present a novel data structure that uses linear space in |A| while allowing for two-dimensional orthogonal range queries with logarithmic pre-processing and constant-delay enumeration.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Agarwal, P.K.: Range searching. In: Handbook of Discrete and Computational Geometry, 2nd edn, pp. 809–837. CRC Press (2004)

    Google Scholar 

  2. Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the ram, revisited. In: Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, 13–15 June 2011, pp. 1–10 (2011)

    Google Scholar 

  3. Mehlhorn, K.: Data Structures and Algorithms: 3. Multidimensional Searching and Com-putational Geometry. Springer, Heidelberg (1994)

    Google Scholar 

  4. Preparata, F.P., Shamos, M.: Computational Geometry. Springer, Heidelberg (1985)

    Book  Google Scholar 

  5. Segoufin, L.: Constant delay enumeration for conjunctive queries. SIGMOD Rec. 44(1), 10–17 (2015)

    Article  Google Scholar 

  6. Wilkinson, B.T.: Exploring the problem space of orthogonal range searching. Ph.D. thesis, Aarhus University (2015)

    Google Scholar 

  7. Willard, D.E.: Applications of range query theory to relational data base join and selection operations. J. Comput. Syst. Sci. 52(1), 157–169 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrea Calí .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Grez, A., Calí, A., Ugarte, M. (2019). A Simple Data Structure for Optimal Two-Sided 2D Orthogonal Range Queries. In: Cuzzocrea, A., Greco, S., Larsen, H., Saccà, D., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2019. Lecture Notes in Computer Science(), vol 11529. Springer, Cham. https://doi.org/10.1007/978-3-030-27629-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27629-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27628-7

  • Online ISBN: 978-3-030-27629-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics