Alternatives and similar repositories for madoka

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

• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆62Updated 4 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆86Updated 4 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• stanford-futuredata / msketch
  Moments Sketch Code
  ☆40Updated 6 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 6 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 4 months ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆20Updated 9 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆47Updated last year
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• edoliberty / streaming-quantiles
  Implements the Karnin-Lang-Liberty (KLL) algorithm in python
  ☆55Updated 2 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 10 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆60Updated last year
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆87Updated 2 months ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• ucbrise / fluent-old
  Bloom + C++
  ☆17Updated 7 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆48Updated 6 years ago
• MonetDB / MonetDBLite-C
  MonetDB as a shared library with a C API
  ☆33Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago