B-Treaps: A Uniquely Represented Alternative to B-Trees
ICALP, pp. 487-499, 2009.
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap . Uniquely represented data structures represent each logical state with a unique machine state. Such data structures are strongly history-independent ; they reveal no information about the historical se...More
Full Text (Upload PDF)
PPT (Upload PPT)