OrangeTide / btreeLinks
lock free modified prefix B+tree append-only database
☆117Updated 10 years ago
Alternatives and similar repositories for btree
Users that are interested in btree are comparing it to the libraries listed below
Sorting:
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 3 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- QSBR and EBR library☆119Updated 5 years ago
- A working project for High-concurrency B-tree source code in C☆250Updated 4 years ago
- Concurrent trie-hash map library☆91Updated last year
- An attempt to split the Raft library out of LogCabin☆37Updated 7 years ago
- Lightweight C coroutines (derived from http://software.schmorp.de/pkg/libcoro.html)☆123Updated last year
- User space threading (aka coroutines) library for C resembling GoLang and goroutines☆166Updated 6 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- C based ordered key-value ACID DB using a skip list data structure☆161Updated 10 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 11 years ago
- ☆66Updated 4 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.☆53Updated 10 years ago
- [deprecated] Data structures and sample applications using Mintomic☆93Updated 9 years ago
- Embedded storage benchmarking tool☆139Updated 2 years ago
- A Paxos implementation in C originally by Marco Primi, built on top of libevent☆36Updated 13 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- A distributed durable unique 64bit ID server☆202Updated 6 years ago
- Log-Structured Merge-Tree (LSM-Tree)☆89Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago