Monday, September 7, 2015

Relaxed Radix Balanced Trees


RRB trees are an implementation of persistent ordered sequences with O(1) time for all operations. The paper is fairly straightforward. The existence of a reference C implementation is nice.

http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf

https://github.com/hyPiRion/c-rrb

No comments:

Post a Comment