Disk-based algorithms for big data


Book


C. G. Healey
CRC Press, 2016

Semantic Scholar DOI
Cite

Cite

APA   Click to copy
Healey, C. G. (2016). Disk-based algorithms for big data. CRC Press.


Chicago/Turabian   Click to copy
Healey, C. G. Disk-Based Algorithms for Big Data. CRC Press, 2016.


MLA   Click to copy
Healey, C. G. Disk-Based Algorithms for Big Data. CRC Press, 2016.


BibTeX   Click to copy

@book{c2016a,
  title = {Disk-based algorithms for big data},
  year = {2016},
  publisher = {CRC Press},
  author = {Healey, C. G.}
}

Abstract

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.


Share



Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in