Advertisement

Orthogonal Range Searching

Querying a Database
  • Mark de Berg
  • Marc van Kreveld
  • Mark Overmars
  • Otfried Schwarzkopf

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.

Keywords

Query Range Query Time Search Path Binary Search Tree Left Child 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Mark de Berg
    • 1
  • Marc van Kreveld
    • 1
  • Mark Overmars
    • 1
  • Otfried Schwarzkopf
    • 2
  1. 1.Department of Computer ScienceUtrecht UniversityTB UtrechtThe Netherlands
  2. 2.Department of Computer SciencePohang University of Science and TechnologyHyoya-Dong, PohangSouth Korea

Personalised recommendations