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

Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 11, Issue 10

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.

Authors and Affiliations

K. S. Easwarakumar, T. Hema

Keywords

Related Articles

Predicting Machine Translation Comprehension with a Neural Network

Comprehension of natural language translations is dependent upon several factors including textual variables (grammatical, spelling, and word choice errors, sentence complexity, etc.) and human variables (language fluenc...

Activity Types Selection in Kindergarten Outdoor Education

Preschool education develops from focus on physical cultivation in traditional agricultural society to professional education in professional institutions such as kindergartens. In recent years, it emphasizes multiple de...

Change Detection on SAR data using PCA Algorithm

In this paper, we proposed an approach for unsupervised change detection technique on SAR data. Change detection is process of automatically identifying and analyzing the regions which undergone some changes such as spat...

Evaluation of a New Mobility Assistive Product for the Visually Impaired

In this study we present the results of evaluating the sonification protocol of a new assistive product aiming to help the visually impaired move more safely with the help of sounds organized in different cognitive profi...

Development of An Examination Authentication Embedded System Based on Fingerprint Approach

Security is crucial all around. Access into institutions, examination centers, organizations or even estates ought to be controlled and closely monitored through a verification system. The method of authenticating a stud...

Download PDF file
  • EP ID EP650399
  • DOI 10.24297/ijct.v11i10.2980
  • Views 61
  • Downloads 0

How To Cite

K. S. Easwarakumar, T. Hema (2013). BITS-Tree -- An Efficient Data Structure for Segment Storage and Query Processing. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 11(10), 3108-3116. https://europub.co.uk/articles/-A-650399