Alternatives and similar repositories for bloomfilter_benchmarks

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

• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last year
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆131Updated 7 months ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated last year
• tum-db / Plush
  Plush: A Write-Optimized Persistent Log-Structured Hash-Table
  ☆18Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 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)
  ☆82Updated 3 years ago
• flode / ARTSynchronized
  ☆123Updated 3 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated 2 months ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated 11 months ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆411Updated 2 months ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 3 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• arif-arman / origami-sort
  Implementation of Origami: A High-Performance Mergesort Framework
  ☆27Updated 11 months ago
• cwida / fsst
  Fast Static Symbol Table (FSST): efficient random-access string compression
  ☆470Updated 3 weeks ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆119Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• CARV-ICS-FORTH / FastMap
  ☆35Updated 4 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆437Updated 9 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆158Updated 6 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆439Updated 3 months ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆446Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year