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

Kresten Krab Thorup da65b9abb1 zip stored bloom filter		2012-01-04 15:48:57 +01:00
src	zip stored bloom filter	2012-01-04 15:48:57 +01:00
test	zip stored bloom filter	2012-01-04 15:48:57 +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