caetanosauer / fineline-zeroLinks
☆12Updated 6 years ago
Alternatives and similar repositories for fineline-zero
Users that are interested in fineline-zero are comparing it to the libraries listed below
Sorting:
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- The Cicada engine☆58Updated 8 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 weeks ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆29Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- Adaptive Radix Tree in C++☆45Updated last month
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- ☆121Updated 3 years ago
- ☆149Updated 2 years ago
- ☆20Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆30Updated 6 years ago
- ☆54Updated last year
- ☆48Updated last year
- ☆12Updated 4 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆73Updated last year
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Quickstep project☆42Updated 9 months ago
- ☆38Updated 5 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago