In previous work, the author introduced the B-treap, a uniquely represented B-tree analogue, and proved strong performance guarantees for it. However, the B-treap maintains complex invariants and is very complex to implement. In this paper we introduce the B-skip-list, which has most of the guarantees of the B-treap, but is vastly simpler and easier to implement. Like the B-treap, the B-skip-list may be used to construct strongly history-independent index structures and filesystems; such constructions reveal no information about the historical sequence of operations that led to the current logical state. For example, a uniquely represented filesystem would support the deletion of a file in a way that, in a strong information-theoretic sense, provably removes all evidence that the file ever existed. Like the B-tree, the B-skip-list has depth O(log B n) where B is the block transfer size of the external memory, uses linear space with high probability, and supports efficient one-dimensional range queries.
Golovin thus proposes a strongly history-independent B-skip list REF as a simpler alternative to the B-treap.
The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees
ArXiv
ArXiv
Computer Science