A fine-grained per-key analysis lets bottom-k cardinality sketches answer many adaptive queries when each key appears in few of them, shifting the quadratic barrier from total query count to per-key participation.
DataSketches , Accessed: 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
A fine-grained per-key analysis lets bottom-k cardinality sketches answer many adaptive queries when each key appears in few of them, shifting the quadratic barrier from total query count to per-key participation.