Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data   In a variety of applications, we need to keep track of the development of a
data set over time. For maintaining and querying this multi version data
I/O-efficiently, external memory data structures are required. In this paper,
we present a probabilistic self-balancing persistent data structure in external
memory called the persistent buffer tree, which supports insertions, updates
and deletions of data items at the present version and range queries for any
version, past or present. The persistent buffer tree is I/O-optimal in the
sense that the expected amortized I/O performance bounds are asymptotically the
same as the deterministic amortized bounds of the (single version) buffer tree
in the worst case.

12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn
30
The categories of this paper are: q-alg
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
6
The categories of this paper are: astro-ph
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
36
The categories of this paper are: cmp-lg