Small Summaries for Big Data

Graham Cormode

ISBN 10: 1108477445 / ISBN 13: 9781108477444

Published by Cambridge University Press Dez 2020, 2020

About this Item

Neuware - 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.

Seller Inventory # 9781108477444

Bibliographic Details

• Title: Small Summaries for Big Data
• Publisher: Cambridge University Press Dez 2020
• Publication Date: 2020
• Language: English
• ISBN 10: 1108477445
• ISBN 13: 9781108477444
• Binding: Buch
• Condition: Neu
• Dimensions: 234W x 159H x 19D millimeters 234 millimeters width by 159 millimeters height by 19 millimeters depth
• Weight: 520 grams

About this title

Synopsis

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.

About the Authors

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 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.