期刊名称：ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
印刷版ISSN：2194-9042
电子版ISSN：2194-9050
出版年度：2005
卷号：XXXVI-2/W25
出版社：Copernicus Publications
摘要：In recent years, spatial database has become an important area of people's interest and research. A fundamental issue in this area is how to store and operate spatial data efficiently. This paper describes a data structure, R-Tree, which is very easy to understand but prove to be very powerful, and the concerning operations on it. In the traditional R-Tree, it's not specified where an R-Tree index can be stored. Either the main memory or the second memory can be used to store R-Tree. In this paper, I give an advanced R-Tree dynamic index structure which shows intuitively what an R-Tree is like. Then you can efficiently complete operations on R-Tree, such as search, insert, delete, node splitting, updates and other operations
关键词：Spatial Database Querying; R-Tree; Dynamic Index Structure
