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

TL;DR

This paper introduces BITS-Tree, a new data structure for efficient dynamic segment storage and querying, allowing flexible insertions beyond current ranges and faster query responses than standard segment trees.

Contribution

The paper presents BITS-Tree, a novel data structure that improves upon standard segment trees by supporting broader insertions and faster query processing.

Findings

Fewer nodes compared to dynamic standard segment trees

Supports insertion of segments beyond current interval range

Achieves faster query response times

Abstract

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.