B-Treaps: A Uniquely Represented Alternative to B-Trees

ICALP, pp. 487-499, 2009.

Cited by: 12|Bibtex|Views2|DOI:https://doi.org/10.1007/978-3-642-02927-1_41
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments