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.
Find a file
2012-01-05 16:46:32 +01:00
src Correct count for merge 2012-01-05 16:46:32 +01:00
test Top-level functionality fractal_btree "works" 2012-01-05 11:48:14 +01:00
.gitignore Initial work-in-progress 2012-01-04 15:05:31 +01:00
README.md first commit 2012-01-04 14:40:22 +01:00
rebar Initial work-in-progress 2012-01-04 15:05:31 +01:00
rebar.config Add basho_bench script/driver 2012-01-05 15:28:39 +01:00