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 last year
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- HOT - Height Optimized Trie☆150Updated 7 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated 2 weeks ago
- ☆53Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- a quotient filter written in C☆84Updated 7 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- Order-preserving key encoder☆122Updated 5 years ago
- A Single-Pass Learned Index☆133Updated 2 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- ☆38Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Succinct C++☆24Updated 4 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Reference implementations of sliding window aggregation algorithms☆45Updated 3 weeks ago
- Fast Approximate Membership Filters (C++)☆278Updated 5 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- Graphs analytics on collections of views!☆35Updated last year
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 2 months ago
- ☆29Updated 5 years ago