Alternatives and similar repositories for w-tinylfu

Users that are interested in w-tinylfu are comparing it to the libraries listed below

• L-v-M / async
  ☆20Updated 2 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 3 months ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 2 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• greensky00 / latency-collector
  Latency collector as an embedded library for C++
  ☆13Updated 5 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆119Updated 5 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆159Updated last year
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 6 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 9 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆147Updated 5 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆158Updated 3 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆27Updated 10 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 3 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆44Updated 3 weeks ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆36Updated 5 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆56Updated last year