Orthogonal Range Searching
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.
KeywordsQuery Range Query Time Search Path Binary Search Tree Left Child
Unable to display preview. Download preview PDF.