affinitydb / kernelLinks
Affinity database C++ kernel library
☆31Updated 11 years ago
Alternatives and similar repositories for kernel
Users that are interested in kernel are comparing it to the libraries listed below
Sorting:
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- NOPaxos consensus protocol☆137Updated 4 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 7 years ago
- Yet Another RAFT implementation☆126Updated 6 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- Core aware thread management system☆236Updated 2 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- A cache-efficiency weight balanced binary tree☆70Updated 11 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- Benchmarks for lockfree datastructures.☆120Updated 11 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Updated 5 years ago
- terark basic library☆24Updated 6 years ago
- libpaxos-cpp is a C++ implementation of the Paxos distributed consensus protocol☆66Updated 12 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- Peloton Design Docs☆27Updated 7 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- A C++ Raft implementation, project moved☆24Updated 8 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- QSBR and EBR library☆125Updated 5 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- rocksdb replicated using rDSN (simple mode)☆12Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- ☆66Updated 4 years ago
- A high-performance, concurrent hash table☆24Updated 11 years ago