Alternatives and similar repositories for cqf

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

• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆88Updated 8 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆115Updated last month
• ot / succinct
  A collection of succinct data structures
  ☆211Updated 2 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆274Updated 6 months ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆101Updated last month
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆158Updated last year
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆103Updated 3 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆109Updated 12 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆47Updated 8 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆109Updated 8 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆64Updated 4 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆109Updated 11 years ago
• luispedro / diskhash
  Diskbased (persistent) hashtable
  ☆167Updated last year
• fanf2 / qp
  qp tries and crit-bit tries
  ☆124Updated 3 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆178Updated 3 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 3 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆45Updated 9 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago