Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Random Buffer Tree : A Randomized Technique for I/O-efficient
  Algorithms   In this paper, we present a probabilistic self-balancing dictionary data
structure for massive data sets, and prove expected amortized I/O-optimal
bounds on the dictionary operations. We show how to use the structure as an
I/O-optimal priority queue. The data structure, which we call as the random
buffer tree, abstracts the properties of the random treap and the buffer tree
and has the same expected I/O-bounds as the buffer tree.

4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
31
The categories of this paper are: ao-sci
34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph