While many 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. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. 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 many applications 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, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of $\mathrm{\Theta }(d)$ bits, where d is the number of bits needed for storing all keys.

虽然分布式计算的许多研究都涵盖了自稳定计算和拓扑的解决方案，但关于分布式数据结构的自稳定的工作却少得多。然而，当对等网络中的对等点崩溃时，分布式数据结构可能不会保持完整。我们提出了一种用于分布式数据结构的自稳定协议，称为Hashed Patricia Trie（Kniesburges 和 Scheideler WALCOM'11），可以对一组键进行有效的前缀搜索。当嵌入到分布式哈希表之上时，该数据结构具有许多应用，同时提供低开销和高效操作。特别是， x的最长前缀匹配可以在$\mathcal{○}(\mathrm{日志}|X|)$哈希表读取访问。我们展示了如何以自稳定的方式维护结构，同时确保合法状态下的低开销和渐近最优的内存需求$\mathrm{\theta }(d)$位，其中d是存储所有密钥所需的位数。