R-trees: A Dynamic Index Structure for Spatial Searching

DMCA

R-trees: A Dynamic Index Structure for Spatial Searching (1984)

Cached

Download Links

Other Repositories/Bibliography

by Antonin Guttman

Venue:	INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
Citations:	2750 - 0 self

BibTeX

@INPROCEEDINGS{Guttman84r-trees:a,
    author = {Antonin Guttman},
    title = {R-trees: A Dynamic Index Structure for Spatial Searching},
    booktitle = {INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA},
    year = {1984},
    pages = {47--57},
    publisher = {ACM}
}

OpenURL

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.

Keyphrases

dynamic index structure spatial searching spatial data geo-data application data object traditional indexing method database system current database system index mechanism data item spatial application multi-dimensional space spatial location non-zero size

DMCA