Streram, sketching and Big Data 2/2

77 views · Published 28 March 2016 · 46:40 · Indexed 18 November 2026

Channel: Institut Henri Poincaré · 2016 · Science & Technology

Watch on YouTube

By Graham Cormode (University of Warwick)
Abstract: A fundamental challenge in processing the massive quantities of information generated by modern applications is in extracting suitable representations of the data that can be stored, manipulated and interrogated on a single machine. A promising approach is in the design and analysis of compact summaries: data structures which capture key features of the data, and which can be created effectively over distributed data sets. Popular summary structures include the count distinct algorithms, which compactly approximate item set cardinalities, and sketches which allow vector norms and products to be estimated. These are very attractive, since they can be computed in parallel and combined to yield a single, compact summary of the data. This talk introduces the concepts and examples of compact summaries as well as some recent developments.

More from this channel