Alternatives and similar repositories for fastfilter_cpp

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

• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last week
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆159Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆109Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆132Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• google / hashtable-benchmarks
  ☆113Updated 2 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 10 months ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆39Updated 2 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago