DocumentCode
468938
Title
A spatial indexing structure based on object partition_ br-tree
Author
Liu, Run-tao ; Hao, Zhong-xiao
Author_Institution
Harbin Univ. of Sci. & Technol., Harbin
Volume
1
fYear
2007
fDate
2-4 Nov. 2007
Firstpage
371
Lastpage
375
Abstract
In this paper, an index structure - BR-tree for spatial data , is proposed by combining the division for spatial data objects with bi-tree. In the structure, the topological relations between spatial data objects are recorded and the overlap between brother nodes is as small as possible. And the algorithm for constructing the BR-tree is presented and its time complexity is given. Finally, the algorithms for node insertion and range query are obtained.
Keywords
database indexing; tree data structures; visual databases; BR-tree; bi-tree; object partition; spatial data objects; spatial indexing; time complexity; Database systems; Environmental management; Indexing; Information analysis; Notice of Violation; Pattern analysis; Pattern recognition; Shape; Spatial databases; Wavelet analysis; BR-tree; index structure; node insertion; range query; spatial database;
fLanguage
English
Publisher
ieee
Conference_Titel
Wavelet Analysis and Pattern Recognition, 2007. ICWAPR '07. International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-1065-1
Electronic_ISBN
978-1-4244-1066-8
Type
conf
DOI
10.1109/ICWAPR.2007.4420696
Filename
4420696
Link To Document