mkarppa / hyperlogloglogLinks
HyperLogLogLog: Counting Distinct Elements With One Log More
☆18Updated 3 years ago
Alternatives and similar repositories for hyperlogloglog
Users that are interested in hyperlogloglog are comparing it to the libraries listed below
Sorting:
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆42Updated last month
- Paper about the estimation of cardinalities from HyperLogLog sketches☆64Updated 4 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 10 months ago
- The recursive model index, a learned index structure☆229Updated 3 months ago
- ⚡ Faster similarity search with PDX: A vertical data layout for vectors☆67Updated 3 weeks ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 7 years ago
- Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits☆17Updated last year
- Learned Index Structures☆52Updated 7 years ago
- GBBS: Graph Based Benchmark Suite☆216Updated last month
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆181Updated last month
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- A Single-Pass Learned Index☆137Updated 2 years ago
- Core C++ Sketch Library☆252Updated this week
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Updated 7 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- A Benchmark for Learned Indexes☆300Updated 3 years ago
- Graphs analytics on collections of views!☆37Updated 2 years ago
- Graph Library for Approximate Similarity Search☆139Updated 4 months ago
- Simple baselines for "Learned Indexes"☆160Updated 8 years ago
- Succinct Data Structure Library 3.0☆101Updated last month
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- ☆39Updated 5 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 11 months ago
- ☆16Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆26Updated last year
- ☆207Updated last week
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Updated 2 years ago