ForestDB-KVStore / forestdbLinks
A fork of Couchbase ForestDB project, aiming at making it simple and generic
☆18Updated 9 months ago
Alternatives and similar repositories for forestdb
Users that are interested in forestdb are comparing it to the libraries listed below
Sorting:
- Adaptive Radix Tree in C++☆50Updated this week
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- The C++ TiKV client used by TiFlash.☆41Updated 3 weeks ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆82Updated 2 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆76Updated 4 years ago
- An embedded key-value store library specialized for building state machine and log store☆236Updated last week
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆18Updated 7 years ago
- ☆20Updated 3 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- A cache-efficiency weight balanced binary tree☆71Updated 11 years ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- Object Storage on CRAQ: High-Throughput Chain Replication for Read-Mostly Workloads☆38Updated 13 years ago
- A data structure and algorithm library built for ToplingDB☆60Updated last week
- Hiactor is a distributed C++ actor framework.☆118Updated last year
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Updated last month
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆56Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- In-memory, columnar, arrow-based database.☆48Updated 3 years ago
- The Cicada engine☆59Updated 8 years ago
- ☆12Updated 7 years ago
- ☆14Updated 2 years ago
- A toy memory store with great performance☆37Updated 3 weeks ago
- C++ fast transactional key-value storage.☆176Updated this week
- BLInk Tree logic - storage and locking experiment☆28Updated 11 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago