indutny / bplus
Append-only B+ tree implemented in C
☆33Updated 4 years ago
Alternatives and similar repositories for bplus:
Users that are interested in bplus are comparing it to the libraries listed below
- Netstring parsing in C☆35Updated 4 years ago
- Reactor polling pattern for ZeroMQ☆30Updated 14 years ago
- Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.☆52Updated 10 years ago
- Rolla - Tiny, fast, crash-safe embedded k/v storage engine☆53Updated 2 years ago
- Chainable SSL implementation for libuv☆57Updated 6 years ago
- libev network library following nodejs's api☆12Updated 8 years ago
- a fork of http://code.google.com/p/libtask/☆43Updated 13 years ago
- An attempt to split the Raft library out of LogCabin☆37Updated 7 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Keyspace is a consistently replicated, fault-tolerant key-value store.☆45Updated 14 years ago
- LMAX's disruptor pattern implemented in C☆96Updated 6 years ago
- Lock-free linked list☆16Updated 12 years ago
- Library to catch mysql binlog updates online in your application.☆21Updated 5 years ago
- Eventually Persistent in-memory database.☆80Updated 7 years ago
- Fast cross-platform async network library☆16Updated 5 years ago
- memcachedb ported from BerkeleyDB to LMDB originally from http://memcachedb.googlecode.com/svn/trunk☆86Updated 9 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- An HTTP and websocket protocol implementation for libev event loop (UNMAINTAINED, use rust and tk-http crate)☆38Updated 7 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- A C++ Raft implementation, project moved☆24Updated 8 years ago
- Concurrent trie-hash map library☆91Updated last year
- Userspace TCP/IP stack☆68Updated 11 years ago
- Dynamic-language-like data structure for C☆13Updated 8 years ago
- Unofficial mirror.☆58Updated 11 years ago
- C based ordered key-value ACID DB using a skip list data structure☆161Updated 10 years ago
- libuv-internals is a collection of snippets which try to show up some architecture sections of libuv on simple examples☆37Updated 11 years ago
- a simple btree implementation with automatic space reclaiming☆275Updated 6 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆45Updated 3 years ago
- M:N fiber implementation, with transparent IO reactor and timeouts, POSIX like APIs.☆16Updated 12 years ago
- Small, safe and fast formatting library☆16Updated 6 years ago