HanoiDB Indexed Key/Value Storage
HanoiDB implements an indexed, key/value storage engine. The primary index is a log-structured merge tree (LSM-BTree) implemented using "doubling sizes" persistent ordered sets of key/value pairs, similar is some regards to LevelDB. HanoiDB includes a visualizer which when used to watch a living database resembles the "Towers of Hanoi" puzzle game, which inspired the name of this database.
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout devel:languages:erlang/erlang-hanoidb && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| checkout.sh | 0000000843 843 Bytes | |
| erlang-hanoidb.changes | 0000000133 133 Bytes | |
| erlang-hanoidb.spec | 0000003149 3.08 KB | |
| hanoidb-0.0.0+git20130625.tar.bz2 | 0000826517 807 KB | |
| no-rebar-deps.patch | 0000001341 1.31 KB |
Revision 2 (latest revision is 3)
Matwey Kornilov (matwey)
accepted
request 180949
from
Nico Kruber (NicoK)
(revision 2)
fix erlang-lz4 dependency
Comments 0