Abstract
At first sight it seems that databases have little to do with geometry. Nevertheless, many types of questions—from now on called queries—about data in a database can be interpreted geometrically. To this end we transform records in a database into points in a multi-dimensional space, and we transform the queries about the records into queries on this set of points. Let’s demonstrate this with an example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Orthogonal Range Searching. In: Computational Geometry. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77974-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77974-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77973-5
Online ISBN: 978-3-540-77974-2
eBook Packages: Computer ScienceComputer Science (R0)