2 papers
1 files
2 references

Papers Referenced in This Repository

R-trees: a dynamic index structure for spatial searching

A. Guttman
1984
2 references

In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data...

Show 1 reference in code

The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles.

Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider, Bernhard Seeger
1990
2 references

The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the...

Show 1 reference in code
Link copied to clipboard!