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.
Source Files (show merged sources derived from linked package)
|_link||0000000175175 Bytes||1456485215over 2 years ago|
|project.diff||00000013801.35 KB||1456697689over 2 years ago|