OrangeTide / btree
lock free modified prefix B+tree append-only database
☆117Updated 9 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
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆94Updated 5 years ago
- QSBR and EBR library☆119Updated 5 years ago
- Concurrent trie-hash map library☆91Updated last year
- A working project for High-concurrency B-tree source code in C☆250Updated 4 years ago
- ☆66Updated 4 years ago
- Embedded storage benchmarking tool☆138Updated 2 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago
- Lightweight C coroutines (derived from http://software.schmorp.de/pkg/libcoro.html)☆123Updated 11 months ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆141Updated 5 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- A C++ Raft implementation, project moved☆24Updated 8 years ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- LSM-trie☆114Updated 4 years ago
- [deprecated] Data structures and sample applications using Mintomic☆93Updated 9 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 10 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- C based ordered key-value ACID DB using a skip list data structure☆161Updated 10 years ago
- User space threading (aka coroutines) library for C resembling GoLang and goroutines☆165Updated 6 years ago
- An embedded, simple, fast, concurrent, on-disk key-value store using a b+tree.☆40Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- A very fast on-disk database for SHA1-identified objects☆58Updated 8 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- ☆16Updated 7 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆71Updated last year
- C multiplatform coroutine implementation via ucontext, fibers or setjmp☆264Updated 15 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago