hanoidb 
 Storage engine
 An Erlang-based indexed key/value storage engine with log-structured merge tree and efficient range queries
Erlang LSM BTree Storage
306 stars
 37 watching
 58 forks
 
Language: Erlang 
last commit: about 9 years ago 
Linked from   1 awesome list  
 Related projects:
| Repository | Description | Stars | 
|---|---|---|
|    |  A high-performance key-value storage engine designed for the JVM, supporting various use cases and configurations. | 293 | 
|    |  A simple, RPC-based key-value database that provides basic get, set, and delete operations with bidirectional streaming. | 23 | 
|    |  A compact, distributed key-value store with support for polymorphic data and multiple backends. | 177 | 
|    |  An educational project demonstrating a Kubernetes-native NoSQL data store with StatefulSet and persistent volumes. | 23 | 
|    |  A high-performance key-value store with distributed capabilities and an HTTP API | 378 | 
|    |  A distributed in-memory cache with features like Pub/Sub, JSON querying, and consistency mechanisms. | 26 | 
|    |  A protocol for building asynchronous, thread-safe, and consistent key-value stores with low overhead | 300 | 
|    |  A high-performance in-memory storage engine with bitmap indexing for columnar data storage and querying. | 1,442 | 
|    |  An embedded key-value store optimized for fast random lookups and infrequent bulk inserts. | 1,313 | 
|    |  A lightweight key-value storage solution with simple API and support for primitive and custom data structures | 13 | 
|    |  An implementation of a storage mechanism within a decentralized distributed system | 156 | 
|    |  A library providing a simple storage solution using stable memory, allowing canisters to store data without GC costs and upgradeability. | 31 | 
|    |  A vector space index based search engine and embedded library for indexing and querying documents | 569 | 
|    |  A simple string key-value database with support for arrays and JSON | 215 | 
|    |  An optimized key-value store that combines the benefits of LSM and B+ tree data structures for fast read/write performance. | 2,094 |