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

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CG2015★ 2 cited

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

K. S. Easwarakumar, T. Hema

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 inser…