A Rust implementation of the CVM algorithm for counting distinct elements in a stream
-
Updated
Jun 29, 2024 - Rust
A Rust implementation of the CVM algorithm for counting distinct elements in a stream
Dynatrace hash library for Java
Paper related to AI4DB techniques
A Python library for efficient feature ranking and selection on sparse data sets.
PilotScope is a middleware to bridge the gaps of deploying AI4DB (Artificial Intelligence for Databases) algorithms into actual database systems.
Exploratory data analysis of 2 datasets
A crate for estimating the cardinality of distinct elements in a stream or dataset.
ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
Fast Cardinality Estimation of Multi-Join Queries Using Sketches
Scalable Join Cardinality Estimaitor
Estimating k-mer coverage histogram of genomics data
Distributed Cardinality Tracking
Cardinality Estimation Benchmark
Current STAT Learning-based Cardinality Estimation Code Base
A pytorch implementation for FACE: A Normalizing Flow based Cardinality Estimator
Learned model to estimate number of distinct values (NDV) of a population using a small sample.
[VLDB'22] Cardinality Estimation of Approximate Substring Queries using Deep Learning.
Union, intersection, and set cardinality in loglog space
go-cardinality is a Go library that calculates the cardinality and distinct count of values in a dataset, providing efficient and accurate estimations.
Add a description, image, and links to the cardinality-estimation topic page so that developers can more easily learn about it.
To associate your repository with the cardinality-estimation topic, visit your repo's landing page and select "manage topics."