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 2 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 8 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 11 months ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• wuwuz / Vacuum-Filter
  ☆50Updated 4 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆43Updated 2 weeks ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 5 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆42Updated 4 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 3 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated 2 months ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆84Updated last week
• speedskater / hot
  HOT - Height Optimized Trie
  ☆148Updated 7 years ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆10Updated 4 years ago
• llersch / cpp_random_distributions
  Additional C++11 Random Distributions
  ☆17Updated 10 months ago
• dynatrace-research / ShuffleBench
  A benchmark for generic, large-scale shuffle operations on continuous stream of data, implemented with state-of-the-art stream processing…
  ☆13Updated 2 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 10 months ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 8 months ago
• bcgsc / btl_bloomfilter
  The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.
  ☆18Updated 3 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated 2 weeks ago