vimpunk / w-tinylfuLinks
W-TinyLFU cache C++11 header only implementation
☆63Updated 7 years ago
Alternatives and similar repositories for w-tinylfu
Users that are interested in w-tinylfu are comparing it to the libraries listed below
Sorting:
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- QSBR and EBR library☆135Updated 6 years ago
- ☆20Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆150Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- The Cicada engine☆59Updated 8 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- A working project for High-concurrency B-tree source code in C☆252Updated 5 years ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆141Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆80Updated 11 years ago
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- Latency collector as an embedded library for C++☆13Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- Adaptive Radix Tree in C++☆50Updated last week
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated last month
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 10 months ago