How Long to Read Disk-Based Algorithms for Big Data

How Long Does it Take to Read Disk-Based Algorithms for Big Data?

It takes the average reader 3 hours and 14 minutes to read Disk-Based Algorithms for Big Data by Christopher G. Healey

Assuming a reading speed of 250 words per minute. Learn more

Description

Disk-Based Algorithms for Big Data is a product of recent advances in the areas of big data, data analytics, and the underlying file systems and data management algorithms used to support the storage and analysis of massive data collections. The book discusses hard disks and their impact on data management, since Hard Disk Drives continue to be common in large data clusters. It also explores ways to store and retrieve data though primary and secondary indices. This includes a review of different in-memory sorting and searching algorithms that build a foundation for more sophisticated on-disk approaches like mergesort, B-trees, and extendible hashing. Following this introduction, the book transitions to more recent topics, including advanced storage technologies like solid-state drives and holographic storage; peer-to-peer (P2P) communication; large file systems and query languages like Hadoop/HDFS, Hive, Cassandra, and Presto; and NoSQL databases like Neo4j for graph structures and MongoDB for unstructured document data. Designed for senior undergraduate and graduate students, as well as professionals, this book is useful for anyone interested in understanding the foundations and advances in big data storage and management, and big data analytics. About the Author Dr. Christopher G. Healey is a tenured Professor in the Department of Computer Science and the Goodnight Distinguished Professor of Analytics in the Institute for Advanced Analytics, both at North Carolina State University in Raleigh, North Carolina. He has published over 50 articles in major journals and conferences in the areas of visualization, visual and data analytics, computer graphics, and artificial intelligence. He is a recipient of the National Science Foundation’s CAREER Early Faculty Development Award and the North Carolina State University Outstanding Instructor Award. He is a Senior Member of the Association for Computing Machinery (ACM) and the Institute of Electrical and Electronics Engineers (IEEE), and an Associate Editor of ACM Transaction on Applied Perception, the leading worldwide journal on the application of human perception to issues in computer science.

How long is Disk-Based Algorithms for Big Data?

Disk-Based Algorithms for Big Data by Christopher G. Healey is 188 pages long, and a total of 48,504 words.

This makes it 63% the length of the average book. It also has 59% more words than the average book.

How Long Does it Take to Read Disk-Based Algorithms for Big Data Aloud?

The average oral reading speed is 183 words per minute. This means it takes 4 hours and 25 minutes to read Disk-Based Algorithms for Big Data aloud.

What Reading Level is Disk-Based Algorithms for Big Data?

Disk-Based Algorithms for Big Data is suitable for students ages 10 and up.

Note that there may be other factors that effect this rating besides length that are not factored in on this page. This may include things like complex language or sensitive topics not suitable for students of certain ages.

When deciding what to show young students always use your best judgement and consult a professional.

Where Can I Buy Disk-Based Algorithms for Big Data?

Disk-Based Algorithms for Big Data by Christopher G. Healey is sold by several retailers and bookshops. However, Read Time works with Amazon to provide an easier way to purchase books.

To buy Disk-Based Algorithms for Big Data by Christopher G. Healey on Amazon click the button below.