OrangeTide / btreeLinks
lock free modified prefix B+tree append-only database
☆116Updated 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☆76Updated 4 years ago
- C based ordered key-value ACID DB using a skip list data structure☆164Updated 10 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆138Updated 6 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- User space threading (aka coroutines) library for C resembling GoLang and goroutines☆166Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- QSBR and EBR library☆135Updated 6 years ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- Lightweight C coroutines (derived from http://software.schmorp.de/pkg/libcoro.html)☆125Updated last year
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 5 years ago
- Embedded storage benchmarking tool☆139Updated this week
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.☆55Updated 10 years ago
- ☆66Updated 5 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- A very fast on-disk database for SHA1-identified objects☆57Updated 9 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆96Updated 6 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- C multiplatform coroutine implementation via ucontext, fibers or setjmp☆265Updated 16 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Critbit trees in C☆334Updated 4 years ago
- An efficient trie implementation.☆255Updated 5 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆53Updated 4 years ago
- qp tries and crit-bit tries☆123Updated 3 years ago
- High performance utility library for C☆97Updated 6 months ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago