Gratuit avec l'essai de 30 jours
-
Algorithms and Data Structures for Massive Datasets
- Narrateur(s): Mark Thomas
- Durée: 9 h et 45 min
Échec de l'ajout au panier.
Échec de l'ajout à la liste d'envies.
Échec de la suppression de la liste d’envies.
Échec du suivi du balado
Ne plus suivre le balado a échoué
Algorithms and Data Structures for Massive Datasets
Acheter pour 25,00$
Aucun mode de paiement valide enregistré.
Nous sommes désolés. Nous ne pouvons vendre ce titre avec ce mode de paiement
Description
Massive modern datasets make traditional data structures and algorithms grind to a halt. This fun and practical guide introduces cutting-edge techniques that can reliably handle even the largest distributed datasets.
In Algorithms and Data Structures for Massive Datasets you will learn:
- Probabilistic sketching data structures for practical problems
- Choosing the right database engine for your application
- Evaluating and designing efficient on-disk data structures and algorithms
- Understanding the algorithmic trade-offs involved in massive-scale systems
- Deriving basic statistics from streaming data
- Correctly sampling streaming data
- Computing percentiles with limited space resources
Algorithms and Data Structures for Massive Datasets reveals a toolbox of new methods that are perfect for handling modern big data applications. You’ll explore the novel data structures and algorithms that underpin Google, Facebook, and other enterprise applications that work with truly massive amounts of data. These effective techniques can be applied to any discipline, from finance to text analysis. Graphics and hands-on industry examples make complex ideas practical to implement in your projects—and there’s no mathematical proofs to puzzle over. Work through this one-of-a-kind guide, and you’ll find the sweet spot of saving space without sacrificing your data’s accuracy. Examples are in Python, R, and pseudocode.
About the technology
Standard algorithms and data structures may become slow—or fail altogether—when applied to large distributed datasets. Choosing algorithms designed for big data saves time, increases accuracy, and reduces processing cost.
About the authors
Dzejla Medjedovic earned her PhD in the Applied Algorithms Lab at Stony Brook University, New York. Emin Tahirovic earned his PhD in biostatistics from University of Pennsylvania. Illustrator Ines Dedovic earned her PhD at the Institute for Imaging and Computer Vision at RWTH Aachen University, Germany.
PLEASE NOTE: When you purchase this title, the accompanying PDF will be available in your Audible Library along with the audio.