s-yata / madoka

Related projects ⓘ

Alternatives and complementary repositories for madoka

• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆126Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• jonahharris / libcuckoofilter
  A C library implementation of a Cuckoo Filter
  ☆24Updated 3 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆44Updated 5 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆38Updated 9 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆61Updated 3 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 3 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆45Updated 9 months ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 10 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆50Updated 6 years ago
• vladb38 / rocksdb_protobuf
  ☆15Updated 9 years ago
• ucbrise / fluent-old
  Bloom + C++
  ☆17Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• fanf2 / qp
  qp tries and crit-bit tries
  ☆119Updated 2 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 4 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• migotom / heavykeeper
  Top-K elephant flows finding using HeavyKeeper accurate algorithm
  ☆28Updated last year
• alabid / countminsketch
  Implementation of Count Min Sketch in C++
  ☆54Updated 5 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 7 years ago
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆57Updated last year