彩虹跳跃图：一种容错恒度P2P中继结构
The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure
摘要：
我们提出了一种分布式的数据结构，我们称之为彩虹跳跃图。据我们所知，这是第一个对等数据结构，同时实现高容错，恒定大小的节点，快速更新和查询时间的有序数据。它是Harvey等人和Aspnes和Shah的SkipNet/skip-graph结构的非平凡适应，以便像这些结构一样提供容错，但是使用恒定大小的节点来实现，如Zatloukal和Harvey的家族树结构。它支持后继查询的一组n个项目使用O（log n）的消息具有很高的概率，改进了预期的O（log n）消息的家庭树。
英文摘要：
We present a distributed data structure, which we call the rainbow skip graph. To our knowledge, this is the first peer-to-peer data structure that simultaneously achieves high fault tolerance, constant-sized nodes, and fast update and query times for ordered data. It is a non-trivial adaptation of the SkipNet/skip-graph structures of Harvey et al. and Aspnes and Shah, so as to provide fault-tolerance as these structures do, but to do so using constant-sized nodes, as in the family tree structure of Zatloukal and Harvey. It supports successor queries on a set of n items using O(log n) messages with high probability, an improvement over the expected O(log n) messages of the family tree.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
