llersch / cpp_random_distributions

Related projects: ⓘ

• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆46Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆30Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆50Updated 4 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆17Updated 5 years ago
• harald-lang / tree-encoded-bitmaps
  ☆36Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆138Updated 6 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆20Updated 2 weeks ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated 7 months ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆22Updated 7 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 3 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆49Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆26Updated 4 years ago
• jermp / pthash
  Fast and compact minimal perfect hash functions in C++.
  ☆187Updated 3 weeks ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 3 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆110Updated 7 months ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• bhavanajain / concurrent-priority-queues
  Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based
  ☆9Updated 6 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated last year
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 3 months ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆14Updated last week
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 3 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆147Updated 5 months ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆10Updated 2 months ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆32Updated last year
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆19Updated 3 years ago
• wuwuz / Vacuum-Filter
  ☆48Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago
• njulands / HashAdaptiveBF
  ☆14Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆102Updated 6 years ago