DocumentCode
2540736
Title
QR-tree: a hybrid spatial index structure
Author
Fu, Yu-chen ; Hu, Zhi-yong ; Guo, Wei ; Zhou, Dong-ru
Author_Institution
Comput. Sch., Wuhan Univ., Hubei, China
Volume
1
fYear
2003
fDate
2-5 Nov. 2003
Firstpage
459
Abstract
In this paper, we present a quick speed spatial indexing structure, which is based on quadtree and R-tree. We name it QR-tree. The research indicates although QR-tree always demands more storage space than R-tree, it gains better performance in insertion, deletion, and especially searching. It also shows that the more amounts of spatial data is, the closer the storage cost of QR-tree and R-tree are and the better performance QR-tree has. In other word, for very large spatial database, QR-tree possesses more superiority than R-tree.
Keywords
indexing; quadtrees; spatial data structures; visual databases; QR-tree; R-tree; deletion; insertion; quadtree; searching; spatial database; spatial index structure; Books; Costs; Data structures; Database systems; Indexing; Multidimensional systems; Performance gain; Spatial databases; Spatial indexes; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN
0-7803-8131-9
Type
conf
DOI
10.1109/ICMLC.2003.1264521
Filename
1264521
Link To Document