An Efficient Spatial Index Structure
Ping Li
Abstract
Ping Li
Abstract
In order to handle spatial data efficiently, a database system needs an index mechanism that will help it retrieve data items quickly. However, traditional index methods are not well suited to access spatial data objects because of the special properties of spatial data. In this paper we introduce one of the most popular index structure Rtree and its major algorithms. We implement the R-tree indexing in SADBS which is a spatial analysis database system developed by us.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to handle spatial data efficiently, a database system needs an index mechanism that will help it retrieve data items quickly. However, traditional index methods are not well suited to access spatial data objects because of the special properties of spatial data. In this paper we introduce one of the most popular index structure Rtree and its major algorithms. We implement the R-tree indexing in SADBS which is a spatial analysis database system developed by us.
Key concepts: Spatial database, Search engine indexing, R-tree, Index (typography), Computer science, Spatial analysis, Data mining, Database index