Alternatives and similar repositories for PR

Users that are interested in PR are comparing it to the libraries listed below

• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆137Updated this week
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 9 months ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 15 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆56Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated last month
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• llnl / umap
  User-space Page Management
  ☆111Updated last year
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆27Updated last year
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆26Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• viktorleis / mmapbench
  ☆147Updated 3 years ago
• L-v-M / async
  ☆20Updated 3 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆83Updated 3 years ago
• domargan / awesome-numa
  A community-oriented list of useful NUMA-related libraries, tools, and other resources
  ☆76Updated 5 years ago
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆16Updated 3 years ago
• tuhhosg / exmap
  ☆50Updated last year
• efficient / mica2
  A fast in-memory key-value store
  ☆52Updated 8 years ago
• unodb-dev / unodb
  Adaptive Radix Tree in C++
  ☆48Updated 2 weeks ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago