janneku / btreeLinks
In-memory generic B-tree implementation
☆27Updated 14 years ago
Alternatives and similar repositories for btree
Users that are interested in btree are comparing it to the libraries listed below
Sorting:
- B+ tree implementation in C☆131Updated 5 years ago
- Log-Structured Merge-Tree (LSM-Tree)☆90Updated 8 years ago
- A working project for High-concurrency B-tree source code in C☆252Updated 5 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆76Updated 4 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆90Updated 3 years ago
- Implementation of the Slab Allocator as described in "The Slab Allocator: An Object-Caching Kernel Memory Allocator" by Jeff Bonwick.☆36Updated 11 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- Minix 1.1 to 2.0.4☆53Updated 7 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- A Paxos implementation in C originally by Marco Primi, built on top of libevent☆35Updated 14 years ago
- POSIX-like scalable multicore research OS kernel☆197Updated 5 years ago
- A very fast on-disk database for SHA1-identified objects☆57Updated 9 years ago
- Buffer based LRU cache☆40Updated 2 years ago
- Unofficial repo of historical Oracle BerkeleyDB source☆47Updated 10 years ago
- High performance AVL tree container C implementation☆57Updated 5 years ago
- Different implementations of spinlock.☆105Updated 11 years ago
- skip list with rank, code less than z_set in redis☆175Updated 2 years ago
- New IndexFS core☆26Updated 9 years ago
- Red-black tree C implementation☆37Updated 7 years ago
- A buffered-tree implemented in dictionary type and more☆75Updated 12 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB☆426Updated 12 years ago
- High performance C implementation of AVL trees☆104Updated 6 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆80Updated 10 years ago
- Implemet Key-Value store using BTree☆66Updated 6 years ago
- A cache-efficiency weight balanced binary tree☆71Updated 11 years ago
- Slab Memory Allocator in Application Layer☆29Updated 8 years ago
- An embedded, simple, fast, concurrent, on-disk key-value store using a b+tree.☆40Updated 6 years ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- Russ Cox's libtask (with enhancements)☆322Updated 13 years ago