greg/hanoidb
1
0
Fork 0
Code Issues 10 Pull requests 3 Projects Releases Packages Wiki Activity
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.
5 commits 4 branches 0 tags 2.4 MiB
Erlang 94.9%
Shell 3.5%
Nix 1.1%
Makefile 0.5%
Find a file
Kresten Krab Thorup cdadb88ebf Top-level functionality fractal_btree "works" 
There is a single unit test for the aggregate
functionality, so basic interactions work.

[Too many log messages right now]
2012-01-05 11:48:14 +01:00
src Top-level functionality fractal_btree "works" 2012-01-05 11:48:14 +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 bloom filter to btree index format 2012-01-04 15:36:52 +01:00

README.md