greg/hanoidb: 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.

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

Erik Søe Sørensen 0ff2a2528e Merge branch 'master' of github.com:krestenkrab/fractal_btree		2012-01-05 17:31:30 +01:00
src	Merge pull request #1 from eriksoe/level_mainloop_simplification	2012-01-05 08:31:10 -08:00
test	Implement new merge algorithm	2012-01-05 17:07:49 +01:00
.gitignore	Initial work-in-progress	2012-01-04 15:05:31 +01:00
levelpresence.sh	Add level progress visualization script.	2012-01-05 17:24:58 +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

README.md