Alternatives and similar repositories for cpp_random_distributions:

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

• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 11 months ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆24Updated last year
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆56Updated this week
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 5 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• sfu-dis / FPTree
  An open-source FPTree implementation
  ☆27Updated 2 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 2 years ago
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆14Updated 3 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• wuwuz / Vacuum-Filter
  ☆50Updated 5 months ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆51Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• madsys-dev / ROART
  Range Optimized Adaptive Radix Tree
  ☆23Updated 2 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated last month
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• cosmoss-jigu / pactree
  ☆28Updated 3 years ago
• bhavanajain / concurrent-priority-queues
  Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based
  ☆8Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• baotonglu / dex
  DEX: Scalable Range Indexing on Disaggregated Memory
  ☆23Updated 8 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago