Voldemort is a distributed key-value storage system. Data is automatically replicated over multiple servers. Data is automatically partitioned so each server contains only a subset of the total data. 
Server failure is handled transparently. It is used at LinkedIn for certain high-scalability storage problems where simple functional partitioning is not sufficient.

Project-voldemort - A distributed database, Clone of Amazon's Dynamo

BadgerDB is an embeddable, persistent, simple and fast key-value (KV) store, written purely in Go. It's meant to be a performant alternative to non Go based key-value stores like RocksDB. It is written out of frustration with existing KV stores which are either written in pure Go and slow, or fast but require usage of Cgo. Badger aims to provide an equal or better speed compared to industry leading KV stores (like RocksDB), while maintaining the entire code base in pure Go.

BadgerDB - Fast key-value store in Go.

Ehcache is an open source, standards-based cache used to boost performance, offload the database and simplify scalability. Ehcache is robust, proven and full-featured and this has made it the most widely-used Java-based cache. Its features include: 
 <UL>
	<LI>Fast and Light Weight</LI>
	<LI>Scalable to hundreds of caches</LI>
	<LI>Multiple CacheManagers per virtual machine</LI>
	<LI>Distributed Caching</LI>
	<LI>Provides LRU, LFU and FIFO cache eviction policies</LI>
	<LI>Supports Object or Serializable caching</LI>
	<LI>Full implementation of JSR107 JCACHE API</LI>
	<LI>Extensible</LI>
	<LI>Persistence, Flush to disk on demand</LI>
	<LI>Supports as standalone server, SOAP cache server, RESTful cache server</LI>
	<LI>Works with Hibernate, Google App Engine </LI>
 </UL>

Ehcache is an open source, standards-based cache used to boost performance, offload the database and simplify scalability. Ehcache is robust, proven and full-featured and this has made it the most widely-used Java-based cache.

Ehcache

FoundationDB is a distributed database designed to handle large volumes of structured data across clusters of commodity servers. It organizes data as an ordered key-value store and employs ACID transactions for all operations. It is especially well-suited for read/write workloads but also has excellent performance for write-intensive workloads. Users interact with the database using API language binding.
 
FoundationDB is multi-model, meaning you can store many types data in a single database. All data is safely stored, distributed, and replicated in the Key-Value Store component. It provides amazing performance on commodity hardware, allowing you to support very heavy loads at low cost.

FoundationDB is a distributed database designed to handle large volumes of structured data across clusters of commodity servers. It organizes data as an ordered key-value store and employs ACID transactions for all operations. It is especially well-suited for read/write workloads but also has excellent performance for write-intensive workloads. Users interact with the database using API language binding. 

FoundationDB - Distributed, Transactional Key-value store

Caffeine is a high performance, near optimal caching library based on Java 8. It provides an in-memory cache using a Google Guava inspired API.
 
<ul>
<li><a href="https://github.com/ben-manes/caffeine/wiki/Population">automatic loading of entries</a> into the cache, optionally asynchronously</li>
<li><a href="https://github.com/ben-manes/caffeine/wiki/Eviction#size-based">size-based eviction</a> when a maximum is exceeded based on <a href="https://github.com/ben-manes/caffeine/wiki/Efficiency">frequency and recency</a></li>
<li><a href="https://github.com/ben-manes/caffeine/wiki/Eviction#time-based">time-based expiration</a> of entries, measured since last access or last write</li>
<li><a href="https://github.com/ben-manes/caffeine/wiki/Refresh">asynchronously refresh</a> when the first stale request for an entry occurs</li>
<li>keys automatically wrapped in <a href="https://github.com/ben-manes/caffeine/wiki/Eviction#reference-based">weak references</a></li>
<li>values automatically wrapped in <a href="https://github.com/ben-manes/caffeine/wiki/Eviction#reference-based">weak or soft references</a></li>
<li><a href="https://github.com/ben-manes/caffeine/wiki/Removal">notification</a> of evicted (or otherwise removed) entries</li>
<li><a href="https://github.com/ben-manes/caffeine/wiki/Writer">writes propagated</a> to an external resource</li>
<li>accumulation of cache access <a href="https://github.com/ben-manes/caffeine/wiki/Statistics">statistics</a></li>
</ul>

Caffeine is a high performance, near optimal caching library based on Java 8. It provides an in-memory cache using a Google Guava inspired API.

Caffeine -  A high performance caching library for Java 8

DiskCache is a disk and file backed cache library, written in pure-Python, and compatible with Django. The cloud-based computing of 2021 puts a premium on memory. Gigabytes of empty space is left on disks as processes vie for memory. Among these processes is Memcached (and sometimes Redis) which is used as a cache. It is good to use empty disk space for caching.
 
DiskCache efficiently makes gigabytes of storage space available for caching. By leveraging rock-solid database libraries and memory-mapped files, cache performance can match and exceed industry-standard solutions. There's no need for a C compiler or running another process. Performance is a feature and testing has 100% coverage with unit tests and hours of stress.

DiskCache is a disk and file backed cache library, written in pure-Python, and compatible with Django. The cloud-based computing of 2021 puts a premium on memory. Gigabytes of empty space is left on disks as processes vie for memory. Among these processes is Memcached (and sometimes Redis) which is used as a cache. It is good to use empty disk space for caching.

DiskCache - Python disk backed cache (Django-compatible). Faster than Redis and Memcached. Pure-Python

Ristretto is a fast, concurrent cache library built with a focus on performance and correctness. Its features include Concurrency, High Hit Ratios, Fast Throughput, Cost-Based Eviction, Metrics support.

Ristretto - A high performance memory-bound Go cache

The Apache Accumulo sorted, distributed key/value store is a robust, scalable, high performance data storage and retrieval system. Apache Accumulo is based on Google's BigTable design and is built on top of Apache Hadoop, Zookeeper, and Thrift. Apache Accumulo features a few novel improvements on the BigTable design in the form of cell-based access control and a server-side programming mechanism that can modify key/value pairs at various points in the data management process.

Apache Accumulo - Key Value Store based on Google BigTable

ArangoDB is a multi-purpose open-source database with flexible data model for documents, graphs, and key-values. Build high performance application using a convenient sql-like query language or JavaScript/Ruby extensions. Its key features are  Schema-free, Convenient querying using AQL, Extendable through JS, Space efficiency, Supports modern storage hardware, like SSD and large caches and lot more.

ArangoDB - The Multi-purpose NoSQL DB

Dynomite, inspired by Dynamo whitepaper, is a thin, distributed dynamo layer for different storages and protocols. Dynomite is a sharding and replication layer. Dynomite can make existing non distributed datastores, such as Redis or Memcached, into a fully distributed & multi-datacenter replicating datastore.

Dynomite - Making Non-Distributed Databases, Distributed 

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.
 
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

Chronicle Map is a high performance, off-heap, key-value, in memory, persisted data store. It works like a  standard java map yet it automatically distributes data between processes, these processes can be both on the same server or across your network. In other words its a low latency, huge data key value store, which can store terabytes of data locally to your process.

Chronicle Map - High performance, off-heap, key-value, in memory, persisted data store

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.

cache2k focuses on providing a well engineered in-memory object cache implementation for Java applications. It has fastest access times, due to non blocking and wait free access of cached values. It is thread safe, with a complete set of atomic operations. It supports automatic expiry and refresh: duration or point in time, variable expiry per entry, delta calculations.

Cache2k –  Lightweight, high performance Java caching 

moss provides a simple, fast, persistable, ordered key-val collection implementation as a 100% golang library.moss stands for "memory-oriented sorted segments".

moss - A simple, fast, ordered, persistable, key-val storage library for golang

Discover open source projects across all platforms

Projects