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

Authors

  • K.S. Easwarakumar College of Engineering, Anna University, Chennai
  • T. Hema College of Engineering, Anna University, Chennai

DOI:

https://doi.org/10.24297/ijct.v11i10.2980

Keywords:

Segment Trees, Stabbing Query, Threaded Binary Tree, Height Balancing.

Abstract

In this paper, a new and novel data structure is proposed to dynamically insert and delete segments. Unlike the standard segment trees, 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.

Downloads

Download data is not yet available.

Author Biographies

K.S. Easwarakumar, College of Engineering, Anna University, Chennai

Department of Computer Science and Engineering

T. Hema, College of Engineering, Anna University, Chennai

Department of Computer Science and Engineering

Downloads

Published

2013-12-05

How to Cite

Easwarakumar, K., & Hema, T. (2013). BITS-Tree -- An Efficient Data Structure for Segment Storage and Query Processing. INTERNATIONAL JOURNAL OF COMPUTERS &Amp; TECHNOLOGY, 11(10), 3108–3116. https://doi.org/10.24297/ijct.v11i10.2980

Issue

Section

Research Articles