
Disk-Based Algorithms for Big Data: A Comprehensive Guide to Storage and Data Management by Christopher Healey
Inclusive of all applicable taxes. FREE shipping on all orders.
Available Offers
- ๐Free Delivery โ Free shipping on all orders
- ๐ตCash on Delivery โ Pay when your order arrives
- โฉ๏ธ15-Day Easy Returns โ Hassle-free return policy
- ๐Cash on Delivery โ Pay safely when your order arrives
Check Delivery
Product Description
Introduction
In an era where data is being generated at an unprecedented scale, the ability to process and manage massive datasets efficiently has become a cornerstone of modern computing. 'Disk-Based Algorithms for Big Data' by Christopher Healey offers a rigorous yet accessible exploration of the algorithms and data structures that power large-scale data systems. Whether you are a computer science student in India delving into data engineering or a professional working with distributed storage, this book provides the foundational knowledge needed to understand how data is stored, retrieved, and manipulated when it resides on physical disks.
Book Overview
This hardcover volume from CRC Press bridges the gap between theoretical computer science and practical big data engineering. It begins with the fundamentals of hard disk drives and their impact on data management, then builds a comprehensive understanding of in-memory sorting and searching algorithms. The book progresses to on-disk techniques such as mergesort, B-trees, and extendible hashing. Later chapters cover advanced storage technologies like solid-state drives and holographic storage, peer-to-peer communication, and modern distributed file systems and query languages including Hadoop/HDFS, Hive, Cassandra, and Presto. The book also introduces NoSQL databases like Neo4j for graph data and MongoDB for document stores.
Key Highlights
- Practical focus on disk-based data structures: Understand how B-trees, hash tables, and sorting algorithms work when data exceeds main memory.
- Coverage of both classical and modern storage: From traditional hard disks to SSDs and emerging holographic storage technologies.
- In-depth exploration of distributed systems: Learn about HDFS, Hive, Cassandra, Presto, and their underlying algorithms.
- NoSQL databases for real-world applications: Detailed discussion of Neo4j for graph data and MongoDB for document-based storage.
- Authored by an expert: Christopher Healey brings years of research and teaching experience to make complex topics understandable.
Inside the Book
The book is structured to take readers on a journey from basic principles to advanced applications. Early chapters introduce the physical characteristics of hard disks and how they influence algorithm design. The middle sections cover in-memory algorithms that serve as building blocks for disk-based methods. Later chapters transition to large-scale distributed file systems, peer-to-peer networks, and modern NoSQL databases. Each chapter includes clear explanations, illustrative diagrams, and practical examples that help Indian students and professionals relate the concepts to real-world data challenges.
Key Topics
- Hard disk architecture and its impact on data access patterns
- Primary and secondary indexing techniques
- In-memory sorting (quicksort, heapsort) and searching (binary search, interpolation search)
- Disk-based sorting using mergesort and external sorting
- B-trees, B+ trees, and extendible hashing
- Solid-state drives and holographic storage technologies
- Peer-to-peer communication protocols
- Hadoop Distributed File System (HDFS) and MapReduce
- Hive, Cassandra, and Presto query engines
- Graph databases with Neo4j
- Document stores with MongoDB
Reader Benefits
- Build a strong foundation: Develop a deep understanding of how data is managed when it cannot fit in memory.
- Enhance your career prospects: Skills in disk-based algorithms and big data systems are highly sought after in India's growing tech industry.
- Practical knowledge: Learn algorithms that are directly applicable to designing efficient data pipelines and storage systems.
- Stay current: Covers both classical techniques and cutting-edge storage technologies.
- Exam-ready content: Ideal for students preparing for competitive exams or university courses in data structures and big data analytics.
Learning Outcomes
By the end of this book, readers will be able to: explain how hard disk drives influence algorithm performance; implement and analyze in-memory sorting and searching algorithms; design disk-based data structures such as B-trees and hash tables; understand the architecture of distributed file systems like HDFS; write queries using Hive and Cassandra; evaluate the trade-offs between different NoSQL databases; and apply these concepts to real-world big data problems. The book equips learners with both theoretical insight and practical skills.
Who Should Read
- Computer science and engineering students in India pursuing degrees in data science or software engineering
- Data engineers and database administrators working with large-scale storage systems
- Researchers and academics interested in algorithms for external memory
- IT professionals transitioning into big data roles
- Anyone preparing for interviews or certifications in big data technologies
About the Author
Christopher Healey is a respected academic and researcher with extensive experience in data management, algorithms, and storage systems. He has taught courses on big data and database systems at leading universities, and his work has been published in top-tier conferences and journals. His ability to explain complex technical concepts in a clear and engaging manner makes this book an invaluable resource for learners at all levels.
About the Publisher
CRC Press is a renowned international publisher of high-quality academic and professional books in science, technology, engineering, and mathematics. With a legacy of excellence spanning decades, CRC Press is trusted by students, researchers, and practitioners worldwide for authoritative and up-to-date content. This hardcover edition is produced to the highest standards, ensuring durability and readability for years of use.
Conclusion
'Disk-Based Algorithms for Big Data' is an essential addition to the library of anyone serious about understanding the inner workings of data-intensive systems. It combines timeless algorithmic principles with modern big data technologies, making it equally valuable for academic study and professional practice. Order your hardcover copy from Bookshops.in today and take a decisive step toward mastering the algorithms that drive the data-driven world.
Quick Summary
Disk-Based Algorithms for Big Data by Christopher Healey is a definitive guide for understanding how storage devices, particularly hard disks, shape data management in large-scale analytics. The book begins with foundational in-memory sorting and searching algorithms, then progresses to on-disk techniques such as mergesort, B-trees, and extendible hashing. It also explores primary and secondary indexing to optimize data retrieval, and transitions to modern storage technologies like solid-state drives (SSDs). This book is ideal for Indian data science students, IT professionals, and researchers who need to manage massive data collections efficiently. Readers will gain practical knowledge of disk-based algorithms that are essential for big data clusters, query optimization, and storage efficiency. By buying from Bookshops.in, you get a high-quality physical copy from a trusted Indian bookstore, ensuring fast delivery and authentic products. Whether you are preparing for a career in data analytics or enhancing your current skills, this book offers a comprehensive, hands-on approach to mastering disk-based data management.
Book Highlights
Book Specifications
| ISBN-13 | 9781138196186 |
| ISBN-10 | 1138196185 |
| Publisher | โ CRC Press |
| Language | โ English |
| Dimensions | โ 15.88 x 1.27 x 23.5 cm |
| Weight | โ 494 g |
| Country | โ India |
| Category | Programming & Software Development โบ Algorithms |
| Genre | Non-fiction |
| Original Language | English |
Frequently Asked Questions
What is Disk-Based Algorithms for Big Data about?
Who is the author of this book?
Is this book suitable for beginners in data science?
What topics are covered in the book?
Does the book include practical examples?
Who is the publisher?
What is the ISBN-13?
Is this book available in hardcover?
What is the price in India?
What language is the book in?
Can this book help with big data analytics?
Does it cover solid-state drives?
Where can I buy this book in India?
Readers Also Search For
Customers Also Bought

Programming
Algorithmische Sprache Und Programmentwicklung | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer | P. Pepper | Springer | by H. Partsch | F. L. Bauer

Programming
Distributed Algorithms | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean-Claude Bermond | Michel Raynal | Springer | by Jean

Programming
Meta-Level Control for Deductive Database Systems | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schmidt | Springer | by Helmut Schm

Programming
Java Web Services | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'Reilly Media | by David A. Chappell | Tyler Jewell | O'

Programming
Database in Depth | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J. Date | O'Reilly Media | by Chris J.

Programming
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problem | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson | Springer | by Nicolas Beldiceanu | Narendra Jussien | Eric Pinson |
Related Products
View All
Computers & Internet
Modern Full-Stack React Projects by Daniel Bugl

Computers & Internet
Mootools 1.2 Beginner's Guide (English, Jacob Gube)

Computers & Internet
Contemporary Methods for Speech Parameterization (Springerbriefs in Electrical and Computer Engineering / Springerbriefs in Speech Technology)

Computers & Internet
Information Technology and Lawyers | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lodder | Anja Oskamp | Springer | by Arno R. Lo

Computers & Internet
Digital Analysis of Remotely Sensed Imagery | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao | McGraw-Hill Companies | by Jay Gao

Computers & Internet
