Product details:
ISBN13: | 9781108477444 |
ISBN10: | 1108477445 |
Binding: | Hardback |
No. of pages: | 278 pages |
Size: | 234x157x19 mm |
Weight: | 510 g |
Language: | English |
253 |
Category:
Small Summaries for Big Data
Publisher: Cambridge University Press
Date of Publication: 12 November 2020
Normal price:
Publisher's listprice:
GBP 45.99
GBP 45.99
Your price:
19 991 (19 040 HUF + 5% VAT )
discount is: 10% (approx 2 221 HUF off)
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
Click here to subscribe.
Availability:
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Can't you provide more accurate information?
Not in stock at Prospero.
Short description:
A comprehensive introduction to flexible, efficient tools for describing massive data sets to improve the scalability of data analysis.
Long description:
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.
'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
'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
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.