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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Agarwal, P.K.: Range searching. In: Handbook of Discrete and Computational Geometry, 2nd edn, pp. 809–837. CRC Press (2004)
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)
Mehlhorn, K.: Data Structures and Algorithms: 3. Multidimensional Searching and Com-putational Geometry. Springer, Heidelberg (1994)
Preparata, F.P., Shamos, M.: Computational Geometry. Springer, Heidelberg (1985)
Segoufin, L.: Constant delay enumeration for conjunctive queries. SIGMOD Rec. 44(1), 10–17 (2015)
Wilkinson, B.T.: Exploring the problem space of orthogonal range searching. Ph.D. thesis, Aarhus University (2015)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
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)