rmind / thmap
Concurrent trie-hash map library
☆91Updated last year
Alternatives and similar repositories for thmap:
Users that are interested in thmap are comparing it to the libraries listed below
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- QSBR and EBR library☆119Updated 5 years ago
- Embedded DB Benchmark Framework☆60Updated 4 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆56Updated last year
- Lock-free slab allocator / freelist.☆66Updated 9 years ago
- Adaptive Radix Tree in C++☆44Updated 2 weeks ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated last month
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- ☆20Updated 2 years ago
- An event loop for C using io_uring☆48Updated last year
- A high-performance hash-table for network packet-processing applications (compatible with DPDK)☆36Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 3 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆71Updated last year
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Source code for example programs from Lord of the io_uring guide☆180Updated 9 months ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆87Updated 3 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆45Updated 3 years ago
- AnchorHash - A Scalable Consistent Hash☆25Updated 3 years ago
- The Cicada engine☆57Updated 7 years ago