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

Autor:	Easwarakumar, K. S., Hema, T.
Rok vydání:	2015
Předmět:	Computer Science - Computational Geometry Computer Science - Data Structures and Algorithms I.3.5
Zdroj:	International Journal of Computers and Technology,11(10):3108-3116, December 2013
Druh dokumentu:	Working Paper
Popis:	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. Comment: 11 pages, 5 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1501.03435 Zobrazit plný text záznamu View this record from Arxiv