Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: BITS-Tree-An Efficient Data Structure for Segment Storage and Query
  Processing   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.

24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat
17
The categories of this paper are: q-fin
31
The categories of this paper are: ao-sci
27
The categories of this paper are: comp-gas
2
The categories of this paper are: math
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph