一种有效的段存储和查询处理数据结构--BITS树
BITS-Tree-An Efficient Data Structure for Segment Storage and Query Processing
摘要：
本文提出了一种新的、新颖的数据结构来动态地插入和删除段。与标准段树[3]不同，所提出的数据结构允许插入具有超出现有树的间隔范围的间隔范围的段，该间隔范围是所有段的端点的最小值和最大值之间的间隔。此外，所提出的树中的节点的数量相比于标准段树的动态版本更少，并且能够比标准段树更快地回答刺入和范围查询。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
