Alternatives and similar repositories for cqf

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

• vedantk / quotient-filter
  a quotient filter written in C
  ☆87Updated 8 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated this week
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆270Updated 5 months ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆156Updated last year
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆65Updated 4 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆99Updated last week
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 3 months ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆46Updated 7 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆122Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago
• efficient / SuRF
  First Practical and General-purpose Range Filter
  ☆550Updated 3 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆143Updated 8 years ago