Tags : Browse Projects

lock-free, concurrent, key/value index with efficient memory-mapped persistence and fast transient storage models

`libslablist` is an implementation of slab lists. Slab lists are a memory efficient data structure, that can optionally keep data sorted in logarithmic time. Here are some comparisons, so that you can get an idea of how Slab Lists perform. First we will compare to `uuavl`. `uuavl` is the AVL ... [More] Tree implementation used in the Illumos kernel. It is among the most memory-efficient and cpu-efficient implementations in the world. `uuavl` uses 10% _less_ time than `libslablist` on sequential input. `uuavl` uses 365% _more_ memory than `libslablist` on sequential input. `uuavl` uses 7% _less_ time than `libslablist` on random input. `uuavl` uses 271% _more_ memory than `libslablist` on random input. [Less]