oertl / hyperloglog-sketch-estimation-paperLinks
Paper about the estimation of cardinalities from HyperLogLog sketches
☆62Updated 4 years ago
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
Sorting:
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- Core C++ Sketch Library☆238Updated 2 weeks ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated 2 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- LSM-trie☆114Updated 4 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆280Updated this week
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- a quotient filter written in C☆86Updated 8 years ago
- ☆54Updated last year
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Succinct Data Structure Library 3.0☆96Updated 2 weeks ago
- The recursive model index, a learned index structure☆224Updated 3 years ago
- A Single-Pass Learned Index☆133Updated 2 years ago
- HOT - Height Optimized Trie☆155Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- ☆38Updated 5 years ago
- High-performance dictionary coding☆105Updated 8 years ago
- Your worst case is our best case.☆140Updated 8 years ago