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
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Dynamic succinct/compressed data structures☆111Updated last year
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- LSM-trie☆114Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- A Single-Pass Learned Index☆133Updated 2 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Core C++ Sketch Library☆241Updated last month
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 6 months ago
- Succinct Data Structure Library 3.0☆95Updated last month
- Fast Approximate Membership Filters (C++)☆284Updated 3 weeks ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- a quotient filter written in C☆86Updated 8 years ago
- ☆38Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 5 months ago
- 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
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 8 months ago