Abstract

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 objects of non-zero size located m multi-dimensional spaces In this paper we describe a dynamic index structure called an R-tree which meets this need, and give algorithms for searching and updating it. We present the results of a series of tests which indicate that the structure performs well, and conclude that it is useful for current database systems in spatial applications

Keywords

Computer scienceSearch engine indexingR-treeSpatial databaseData miningDatabase indexData structureIndex (typography)Spatial analysisSeries (stratigraphy)Tree (set theory)DatabaseInformation retrievalMathematics

Affiliated Institutions

Related Publications

The K-D-B-tree

The problem of retrieving multikey records via range queries from a large, dynamic index is considered. By large it is meant that most of the index must be stored on secondary m...

1981 885 citations

Publication Info

Year
1984
Type
article
Pages
47-47
Citations
6534
Access
Closed

External Links

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

6534
OpenAlex

Cite This

Antonin Guttman (1984). R-trees. , 47-47. https://doi.org/10.1145/602259.602266

Identifiers

DOI
10.1145/602259.602266