Alternatives and similar repositories for Prefix-Filter

Users that are interested in Prefix-Filter are comparing it to the libraries listed below

• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 6 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆132Updated 2 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 3 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆270Updated 5 months ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆157Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆249Updated 2 months ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆108Updated 10 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 9 months ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆64Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆34Updated 9 months ago