Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

R-trees: a dynamic index structure for spatial searching

R-trees: a dynamic index structure for spatial searching R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman University of Cahforma Berkeley 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 multidimensional 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

R-trees: a dynamic index structure for spatial searching

Guttman, Antonin
Association for Computing Machinery — Jun 18, 1984
Download PDF
11 pages

Loading next page...
 
/lp/association-for-computing-machinery/r-trees-a-dynamic-index-structure-for-spatial-searching-ZH0iLI4kb0

References (18)

Datasource
Association for Computing Machinery
Copyright
Copyright © 1984 by ACM Inc.
ISBN
0-89791-128-8
doi
10.1145/602259.602266
Publisher site
See Article on Publisher Site

Abstract

R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman University of Cahforma Berkeley 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 multidimensional 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

There are no references for this article.