| ¡¡ | Chinese Journal of Computers Full Text |
| Title | The Evolvement and Progress of R-Tree Family |
| Authors | ZHANG Ming-Bo1£©,2£© LU Feng1£© SHEN Pai-Wei1£© CHENG Chang-Xiu1£© |
| Address | 1£©£¨State Key Laboratory of Resources and Environmental Information System, Institute of Geographical Sciences and Natural Resources Research, Chinese Academy of Sciences, Beijing 100101£© 2£©£¨School of Architecture and Engineering, |
| Year | 2005 |
| Issue | No.3(289¡ª300) |
| Abstract & Background | In recent years, the research on spatial indexing is arousing more and more interests and attentions. A number of spatial indexing structures based on secondary memory have been proposed for handling the massive spatial data stored in the spatial database rapidly and efficiently. R-tree, proposed by Guttman in 1984, is the most popular dynamic spatial access method and has been widely used in many prototype researches and commercial applications. During the last two decades, more and more R-tree variations have come into being a prosperous R-tree family. In this paper, authors recall the R-tree and its main variations, study the bulk operation, spatial query processing, cost model and query optimizing technique based on R-tree, present the progress about the parallelism, concurrency control and locking strategy based on R-tree, and point out the directions for future work.
keywords spatial database; spatial index; R-tree; spatial query; cost model |