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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.C. (2000). Orthogonal Range Searching. In: Computational Geometry. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04245-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-04245-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04247-2
Online ISBN: 978-3-662-04245-8
eBook Packages: Springer Book Archive