Alternatives and similar repositories for hyperloglog-sketch-estimation-paper

Users that are interested in hyperloglog-sketch-estimation-paper are comparing it to the libraries listed below

• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago
• apache / datasketches-cpp
  Core C++ Sketch Library
  ☆242Updated 2 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆154Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆110Updated last year
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆158Updated 7 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 4 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 8 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆88Updated 4 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated last month
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆133Updated 2 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆265Updated 3 months ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆95Updated 2 months ago
• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆225Updated 3 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆82Updated 3 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆25Updated 2 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 7 months ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated 2 years ago