R-trees: A Dynamic Index Structure for Spatial Searching

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

Cached

Download Links

Other Repositories/Bibliography

CiteULike
DBLP

by Antonin Guttman

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

Versions

Version History

Metadata Version 0

Datum	Value	Source
TITLE	R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING	SVM HeaderParse 0.2
AUTHOR NAME	Antomn Guttman	SVM HeaderParse 0.2
AUTHOR AFFIL	University of Cahforma	SVM HeaderParse 0.2
AUTHOR ADDR	Berkeley	SVM HeaderParse 0.2
ABSTRACT	In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an mdex mechanism that ti help it retrieve data items quickly accordmg to their spatial locations However, traditional mdexmg methods are not well suited to data oblects of non-zero size located m multi-dimensional spaces In this paper we describe a dynarmc mdex structure called an R-tree winch meets this need, and give algorithms for searching and updatmg 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 m spatial applications 1. Intxoduction Spatial data oblects often cover areas m multi-dimensional spaces and are not well represented by pomt locations For example, map objects like counties, census tracts etc occupy regions of non-zero size m two dnnenslons A common operation on spatial data 1s a search for all oblects m an area, for example to find all counties that have land mthm 20 nnles of a particular pomt Tl~s kmd of spatial search occurs frequently m computer tided design (CAD) and geo-data applications, and therefore it 1s unportant to be able to retneve oblects efficiently according to their spatial loca-tion ‘llus research was sponsored by National	SVM HeaderParse 0.2
CITATIONS	0 found