Alternatives and similar repositories for RAMBO_MSMT

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

• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 3 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆13Updated 7 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated 2 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆21Updated 4 months ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆158Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆93Updated 2 weeks ago
• llersch / cpp_random_distributions
  Additional C++11 Random Distributions
  ☆19Updated last year
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆132Updated 2 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆44Updated 5 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆12Updated 2 months ago
• arif-arman / origami-sort
  Implementation of Origami: A High-Performance Mergesort Framework
  ☆27Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆115Updated last month
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆101Updated last month
• jeffrey-xiao / probabilistic-collections-rs
  ☆16Updated 3 years ago