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 | 0000000542 542 Bytes | |
| erlang-hanoidb.spec | 0000003459 3.38 KB | |
| fix-warnings.patch | 0000002648 2.59 KB | |
| hanoidb-0.0.0+git20160204.tar.bz2 | 0000878764 858 KB | |
| new-lz4-lib.patch | 0000000900 900 Bytes | |
| no-rebar-deps.patch | 0000001940 1.89 KB |
Latest Revision
Matwey Kornilov (matwey)
accepted
request 357773
from
Nico Kruber (NicoK)
(revision 3)
update hanoidb and adapt to the new lz4 implementation of sr#357772
Comments 0