Algorithms and estimators for summarization of unaggregated data streams

DOI10.1016/j.jcss.2014.04.009zbMath1311.68010OpenAlexW4206244036MaRDI QIDQ2453543

N. G. Duffield, Mikkel Thorup, Carstent Lund, Edith Cohen, Haim Kaplan

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.009

zbMATH Keywords

random samplingdata streamsIP flowsflow size distributionNetFlowsubpopulation queries

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Perfect $L_p$ Sampling in a Data Stream ⋮ Space-efficient estimation of statistics over sub-sampled streams

Cites Work

• Spatially-decaying aggregation over a network
• Size-estimation framework with applications to transitive closure and reachability
• On the Variance of Subset Sum Estimation
• Summarizing data using bottom-k sketches