eourcs / LockFreeCuckooHash
A fully concurrent lock-free cuckoo hash table implementation
☆56Updated 7 years ago
Alternatives and similar repositories for LockFreeCuckooHash:
Users that are interested in LockFreeCuckooHash are comparing it to the libraries listed below
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- ☆43Updated 4 years ago
- Adaptive Radix Tree in C++☆41Updated last week
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆174Updated 8 years ago
- A data structure and algorithm library built for TerarkDB☆62Updated 2 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆36Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 2 weeks ago
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆145Updated 5 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- ☆20Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆157Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆212Updated last year
- ☆116Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆153Updated 11 months ago
- Library for lock-free locks☆77Updated last year
- QSBR and EBR library☆117Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆273Updated last month
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆99Updated 6 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 2 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆51Updated last year
- Latency collector as an embedded library for C++☆13Updated 5 years ago
- Effective Memory Reclamation☆54Updated 5 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆16Updated 6 years ago
- A cache-efficiency weight balanced binary tree☆70Updated 10 years ago
- Benchmark of common hash functions☆35Updated 5 years ago