Segment B-tree:aa dynamic and efficient interval indexing data structure

Abstract

Spatial data are widly used in computer graphics, GIS,CAD,DBMS,etc. To find an efficient data structure is very important to the system performance. In this paper, we introduce a new data structure,which we call Segment B-tree, for dynamic and efficient interval indexing. Segment B-tree is an improvement to the segment tree by supporting dynamic updating and using B-tree as the frame structure. Algorithms are developed using this new data structure. We give a theoretical analysis of the complexity of those algorithms, which shows the data structure is very good for point query and insertion. we also give the empirical results, which are compared with the results of using other data structures. The empirical results verify the theoretical analysis.