3 ms·
Wonder how this compares with: https://github.com/couchbase/forestdb https://github.com/couchbase/forestdb The idea seems to be Trie uses B+tree as a node. Ke
by rdtsc 12y ago
Wonder how this compares with:
https://github.com/couchbase/forestdb https://github.com/couchbase/forestdb
The idea seems to be Trie uses B+tree as a node. Key is split into 8 byte chunks. Each chunk is used as a key for each level of B+tree
(from their presentation at: http://db.csail.mit.edu/sigmod11contest/sigmod_2011_contest_poster_jungsang_ahn.pdf http://db.csail.mit.edu/sigmod11contest/sigmod_2011_contest_... )