This book takes the design and analyses of algorithms to the level of predictable practical efficiency, discussing core and classic algorithmic problems that arise in the development of big data applications, and presenting elegant solutions of increasing sophistication and efficiency. Paolo Ferragina analyzes solutions within the classic RAM model, and the more practically significant external-memory model that allows one to perform I/O-complexity evaluations.

<ASIN:1009123289>

Chapters cover various data types, including integers, strings, trees, and graphs, algorithmic tools such as sampling, sorting, data compression, and searching in dictionaries and texts, and lastly, recent developments regarding compressed data structures. Algorithmic solutions are accompanied by detailed pseudocode and many running examples, thus enriching the toolboxes of students, researchers, and professionals interested in effective and efficient processing of big data.

Author: Paolo Ferragina
Publisher: Cambridge University Press
Date: June 2023
Pages: 326
ISBN: 978-1009123280
Print: 1009123289
Kindle: B0BZJBGTLN
Audience: General
Level: Intermediate/Advanced
Category: Methodology

For more Book Watch just click.

Book Watch is I Programmer's listing of new books and is compiled using publishers' publicity material. It is not to be read as a review where we provide an independent assessment. Some, but by no means all, of the books in Book Watch are eventually reviewed.

To have new titles included in Book Watch contact  BookWatch@i-programmer.info

Follow @bookwatchiprog on Twitter or subscribe to I Programmer's Books RSS feed for each day's new addition to Book Watch and for new reviews.