BITS-Tree-An Efficient Data Structure for Segment Storage and Query Processing

In this paper, a new and novel data structure is proposed to dynamically insert and delete segments. Unlike the standard segment trees[3], the proposed data structure permits insertion of a segment with interval range beyond the interval range of the existing tree, which is the interval between minimum and maximum values of the end points of all the segments. Moreover, the number of nodes in the proposed tree is lesser as compared to the dynamic version of the standard segment trees, and is able to answer both stabbing and range queries practically much faster compared to the standard segment trees.

[1]  Haim Kaplan,et al.  An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries , 2012, SIAM J. Comput..

[2]  Alan J. Perlis,et al.  Symbol manipulation by threaded lists , 1960, Commun. ACM.

[3]  Mikkel Thorup.  Space efficient dynamic stabbing with fast queries , 2003, STOC '03.

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[7]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[8]  Anja Feldmann,et al.  Tradeoffs for packet classification , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).