Small Summaries for Big Data - Graham Cormode, Ke Yi

Small Summaries for Big Data

, (Autoren)

Buch | Hardcover
278 Seiten
2020
Cambridge University Press (Verlag)
978-1-108-47744-4 (ISBN)
59,80 inkl. MwSt
The massive volume of data generated in modern applications requires the ability to build compact summaries of datasets. This introduction aimed at students and practitioners covers algorithms to describe massive data sets from simple sums to advanced probabilistic structures, with applications in big data, data science, and machine learning.
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.

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.

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.

Erscheinungsdatum
Zusatzinfo Worked examples or Exercises
Verlagsort Cambridge
Sprache englisch
Maße 157 x 234 mm
Gewicht 510 g
Themenwelt Informatik Datenbanken Data Warehouse / Data Mining
Informatik Theorie / Studium Algorithmen
ISBN-10 1-108-47744-5 / 1108477445
ISBN-13 978-1-108-47744-4 / 9781108477444
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Auswertung von Daten mit pandas, NumPy und IPython

von Wes McKinney

Buch | Softcover (2023)
O'Reilly (Verlag)
44,90
Datenanalyse für Künstliche Intelligenz

von Jürgen Cleve; Uwe Lämmel

Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
69,95