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☆127Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Dynamic succinct/compressed data structures☆112Updated last year
- Succinct Data Structure Library 3.0☆94Updated 3 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
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 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☆266Updated 3 weeks ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- Core C++ Sketch Library☆236Updated 3 weeks ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated last month
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆33Updated 6 months ago
- LSM-trie☆114Updated 4 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits☆16Updated 9 months ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 4 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- ☆54Updated last year
- HOT - Height Optimized Trie☆156Updated 7 years ago