Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic Data Structures for Document Collections and Graphs   In the dynamic indexing problem, we must maintain a changing collection of
text documents so that we can efficiently support insertions, deletions, and
pattern matching queries. We are especially interested in developing efficient
data structures that store and query the documents in compressed form. All
previous compressed solutions to this problem rely on answering rank and select
queries on a dynamic sequence of symbols. Because of the lower bound in
[Fredman and Saks, 1989], answering rank queries presents a bottleneck in
compressed dynamic indexing. In this paper we show how this lower bound can be
circumvented using our new framework. We demonstrate that the gap between
static and dynamic variants of the indexing problem can be almost closed. Our
method is based on a novel framework for adding dynamism to static compressed
data structures. Our framework also applies more generally to dynamizing other
problems. We show, for example, how our framework can be applied to develop
compressed representations of dynamic graphs and binary relations.

5
The categories of this paper are: gr-qc
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
20
The categories of this paper are: acc-phys
7
The categories of this paper are: hep-th
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph