Alternatives and similar repositories for bloomfilter_benchmarks

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

• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• tum-db / Plush
  Plush: A Write-Optimized Persistent Log-Structured Hash-Table
  ☆18Updated 3 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆137Updated 3 weeks ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• cwida / fsst
  Fast Static Symbol Table (FSST): efficient random-access string compression
  ☆491Updated 2 months ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆12Updated last year
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆137Updated 2 years ago
• viktorleis / vmcache
  ☆81Updated 4 months ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆456Updated 2 years ago
• arif-arman / origami-sort
  Implementation of Origami: A High-Performance Mergesort Framework
  ☆27Updated last year
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆127Updated last year
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆444Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• leanstore / leanstore
  ☆605Updated 2 weeks ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆300Updated 3 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆422Updated last week
• renzibei / hashtable-bench
  A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible
  ☆25Updated 10 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• FrankBro / be-tree
  BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Space
  ☆42Updated last year
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆70Updated last month
• intel / qpl
  Intel® Query Processing Library (Intel® QPL)
  ☆106Updated last month