HanoiDB implements an ordered k/v pairs storage engine in Erlang. The primary index is a log-structured merge tree (LSM-BTree) implemented using "doubling sizes" persistent ordered sets of kvp.
src | ||
test | ||
.gitignore | ||
levelpresence.sh | ||
README.md | ||
rebar | ||
rebar.config |