Skip Graphs
<|reference_start|>Skip Graphs: Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer systems, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality. Unlike skip lists or other tree data structures, skip graphs are highly resilient, tolerating a large fraction of failed nodes without losing connectivity. In addition, constructing, inserting new nodes into, searching a skip graph, and detecting and repairing errors in the data structure introduced by node failures can be done using simple and straightforward algorithms.<|reference_end|>
@article{aspnes2003skip,
    title={Skip Graphs},
    author={James Aspnes and Gauri Shah},
    journal={arXiv preprint arXiv:cs/0306043},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0306043},
    primaryClass={cs.DS cs.DC}
}