ForestDB is a key-value storage engine developed by Couchbase Caching and Storage Team, and its main index structure is built from Hierarchical B+-Tree based Trie, called HB+-Trie. ForestDB paper has been published in IEEE Transactions on Computers.
<BR><BR>
Compared with traditional B+-Tree based storage engines, ForestDB shows significantly better read and write performance with less storage overhead. ForestDB has been tested on various server OS environments (Centos, Ubuntu, Mac OS x, Windows) and mobile OSs (iOS, Android). The test coverage stats for ForestDB are available in ForestDB Code Coverage Report.

ForestDB is a key-value storage engine developed by Couchbase Caching and Storage Team, and its main index structure is built from Hierarchical B+-Tree based Trie, called HB+-Trie. ForestDB paper has been published in IEEE Transactions on Computers.

ForestDB - A Fast Key-Value Storage Engine Based on Hierarchical B+-Tree Trie

Fast, concurrent, evicting in-memory cache written to keep big number of entries without impact on performance. BigCache keeps entries on heap but omits GC for them. To achieve that operations on bytes arrays take place, therefore entries (de)serialization in front of the cache will be needed in most use cases. 

bigcache - Efficient cache for gigabytes of data written in Go.

Discover open source projects across all platforms

Projects

ForestDB - A Fast Key-Value Storage Engine Based on Hierarchical B+-Tree Trie

bigcache - Efficient cache for gigabytes of data written in Go.

TechStack

Tagcloud

License

Suggested keywords:

Projects

ForestDB - A Fast Key-Value Storage Engine Based on Hierarchical B+-Tree Trie

bigcache - Efficient cache for gigabytes of data written in Go.

TechStack

Tagcloud

License