Evolvement and progress of R-tree family
Ming Zhang, Feng Lu, Shen Paiwei, Cheng Changxiu · Institute of Geographic Sciences and Natural Resources Research, CAS Institutional Repository · 2005
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.