Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Small Summaries for Big Data

Small Summaries for Big Data

Small Summaries for Big Data

Graham Cormode, University of Warwick
Ke Yi, Hong Kong University of Science and Technology
December 2020
Available
Hardback
9781108477444
$65.00
USD
Hardback
USD
eBook

    The massive volume of data generated in modern applications can overwhelm our ability to conveniently transmit, store, and index it. For many scenarios, building a compact summary of a dataset that is vastly smaller enables flexibility and efficiency in a range of queries over the data, in exchange for some approximation. This comprehensive introduction to data summarization, aimed at practitioners and students, showcases the algorithms, their behavior, and the mathematical underpinnings of their operation. The coverage starts with simple sums and approximate counts, building to more advanced probabilistic structures such as the Bloom Filter, distinct value summaries, sketches, and quantile summaries. Summaries are described for specific types of data, such as geometric data, graphs, and vectors and matrices. The authors offer detailed descriptions of and pseudocode for key algorithms that have been incorporated in systems from companies such as Google, Apple, Microsoft, Netflix and Twitter.

    • Examples, figures, and pseudocode enhance understanding of fundamentals and applications
    • Written in accessible plain English
    • Optional sections of advanced technical material provide further reading for experts without overwhelming novices

    Reviews & endorsements

    'A very thorough compendium of sketching and streaming algorithms, and an excellent resource for anyone interested in learning about them, understanding how they work and deploying them in applications. Good job!' Piotr Indyk, Massachusetts Institute of Technology

    See more reviews

    Product details

    December 2020
    Hardback
    9781108477444
    278 pages
    234 × 157 × 19 mm
    0.51kg
    Available

    Table of Contents

    • 1. Introduction
    • 2. Summaries for sets
    • 3. Summaries for multisets
    • 4. Summaries for ordered data
    • 5. Geometric summaries
    • 6. Graph summaries
    • 7. Vector, matrix and linear algebraic summaries
    • 8. Summaries over distributed data
    • 9. Other uses of summaries
    • 10. Lower bounds for summaries.
      Authors
    • Graham Cormode , University of Warwick

      Graham Cormode is a Professor in Computer Science at the University of Warwick, doing research in data management, privacy and big data analysis. Previously, he was a principal member of technical staff at AT&T Labs-Research. His work has attracted more than 14,000 citations and has appeared in more than 100 conference papers, 40 journal papers, and been awarded 30 US Patents. Cormode is the co-recipient of the 2017 Adams Prize for Mathematics for his work on Statistical Analysis of Big Data. He has edited two books on applications of algorithms and co-authored a third.

    • Ke Yi , Hong Kong University of Science and Technology

      Ke Yi is a Professor in the Department of Computer Science and Engineering, Hong Kong University of Science and Technology. He obtained his PhD from Duke University. His research spans theoretical computer science and database systems. He has received the SIGMOD Best Paper Award (2016), a SIGMOD Best Demonstration Award (2015), and a Google Faculty Research Award (2010). He currently serves as an Associate Editor of ACM Transactions on Database Systems and IEEE Transactions on Knowledge and Data Engineering.