Hidden Sketch combines a reversible Bloom filter and a Count-Min sketch to recover heavy hitter keys and exact frequencies from roughly 1.44 n l bits plus a linear number of counters.
HeavyKeeper: An accurate algorithm for finding top-k elephant flows
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Hidden Sketch: A Space-Efficient Reversible Sketch for Tracking Frequent Items in Data Streams
Hidden Sketch combines a reversible Bloom filter and a Count-Min sketch to recover heavy hitter keys and exact frequencies from roughly 1.44 n l bits plus a linear number of counters.