Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Using Hashing to Solve the Dictionary Problem (In External Memory)   We consider the dictionary problem in external memory and improve the update
time of the well-known buffer tree by roughly a logarithmic factor. For any
\lambda >= max {lg lg n, log_{M/B} (n/B)}, we can support updates in time
O(\lambda / B) and queries in sublogarithmic time, O(log_\lambda n). We also
present a lower bound in the cell-probe model showing that our data structure
is optimal.
  In the RAM, hash tables have been used to solve the dictionary problem faster
than binary search for more than half a century. By contrast, our data
structure is the first to beat the comparison barrier in external memory. Ours
is also the first data structure to depart convincingly from the indivisibility
paradigm.

16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
25
The categories of this paper are: patt-sol
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
35
The categories of this paper are: mtrl-th
17
The categories of this paper are: q-fin