Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Self-Stabilizing Hashed Patricia Trie   While a lot of research in distributed computing has covered solutions for
self-stabilizing computing and topologies, there is far less work on
self-stabilization for distributed data structures. Considering crashing peers
in peer-to-peer networks, it should not be taken for granted that a distributed
data structure remains intact. In this work, we present a self-stabilizing
protocol for a distributed data structure called the hashed Patricia Trie
(Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on
a set of keys. The data structure has a wide area of applications including
string matching problems while offering low overhead and efficient operations
when embedded on top of a distributed hash table. Especially, longest prefix
matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read
accesses. We show how to maintain the structure in a self-stabilizing way. Our
protocol assures low overhead in a legal state and a total (asymptotically
optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits
needed for storing all keys.

5
The categories of this paper are: gr-qc
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
25
The categories of this paper are: patt-sol
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
2
The categories of this paper are: math
0
The categories of this paper are: hep-ph