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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BoundlessBookstore, Wallingford, Royaume-Uni
Hardcover. Etat : Very Good. Appears unread. Very good condition. Has light shelf wear. N° de réf. du vendeur 9999-99999318356
Quantité disponible : 1 disponible(s)
Vendeur : BoundlessBookstore, Wallingford, Royaume-Uni
Hardcover. Etat : Very Good. Appears unread. Very good condition. Has light shelf wear. N° de réf. du vendeur 9999-99999318256
Quantité disponible : 1 disponible(s)
Vendeur : BoundlessBookstore, Wallingford, Royaume-Uni
Hardcover. Etat : Very Good. Appears unread. Like new with light shelf wear. N° de réf. du vendeur 9999-99999315856
Quantité disponible : 1 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781108477444
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781108477444_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 270 pages. 9.00x6.00x0.75 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __1108477445
Quantité disponible : 1 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. N° de réf. du vendeur C9781108477444
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26382332216
Quantité disponible : 4 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 270 pages. 9.00x6.00x0.75 inches. In Stock. N° de réf. du vendeur x-1108477445
Quantité disponible : 2 disponible(s)
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : new. Hardcover. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9781108477444
Quantité disponible : 1 disponible(s)