Evolvement and progress of R-tree family

	Evolvement and progress of R-tree family
	Zhang Ming-Bo; Lu Feng; Cheng Chang-Xiu
	2005
关键词	Concurrency control Indexing (of information) Mathematical models Optimization Query languages Trees (mathematics)
英文摘要	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.
出处	Jisuanji Xuebao/Chinese Journal of Computers
卷	28 期:3 页:289-300
收录类别	EI
语种	英语
内容类型	EI期刊论文
源URL	[http://ir.igsnrr.ac.cn/handle/311030/24384]
专题	地理科学与资源研究所_历年回溯文献
推荐引用方式 GB/T 7714	Zhang Ming-Bo,Lu Feng,Cheng Chang-Xiu. Evolvement and progress of R-tree family. 2005.