The eternal sunshine of the sketch data structure

DOI10.1016/J.COMNET.2008.08.014MaRDI QIDQ2377889zbMATH OpenOpenAlexFDO

Authors Xenofontas Dimitropoulos, Marc Stoecklin, Paul Hurley, Andreas Kind

Publication date 20 January 2009

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2008.08.014

zbMATH Keywords

data streamingnetwork monitoringsketch data structure

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• An improved data stream summary: the count-min sketch and its applications
• LATIN 2004: Theoretical Informatics
• Time-decaying sketches for sensor data aggregation
• On Estimating Frequency Moments of Data Streams
• Time-decaying sketches for robust aggregation of sensor data

Cited in

(4)

• Learned sketches for frequency estimation
• Clowns to the left of me, jokers to the right (pearl)
• An improved data stream summary: the count-min sketch and its applications
• Buffered Count-Min Sketch on SSD: Theory and Experiments

This page was built for publication: The eternal sunshine of the sketch data structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377889)