Hadoop权威指南 mobi 下载地址百度云 2025 极速在线

Hadoop权威指南mobi电子书网盘下载地址一

Hadoop权威指南mobi电子书网盘下载地址二

Hadoop权威指南其他格式下载地址

Hadoop权威指南书籍详细信息

ISBN：9787564126766
作者：暂无作者
出版社：东南大学出版社
出版时间：2011-6
页数：600
价格：98.00元
纸张：暂无纸张
装帧：暂无装帧
开本：暂无开本
语言：未知
丛书：暂无丛书
TAG：暂无
豆瓣评分：暂无豆瓣评分
豆瓣短评：点击查看
豆瓣讨论：点击查看
豆瓣目录：点击查看
读书笔记：点击查看
原文摘录：点击查看
更新时间：2025-05-17 02:00:02

内容简介：

《Hadoop权威指南（影印版）（第2版修订版）》揭示了ApacheHadoop如何为你释放数据的力量。这本内容全面的书籍展示了如何使用Hadoop架构搭建和维护可靠、可伸缩的分布式系统。Hadoop架构是MapReduce算法的一种开源应用，是Google开创其帝国的重要基石。程序员可从中探索如何分析海量数据集，管理员可以了解如何建立与运行Had00p集群。本修订版涵盖了Hadoop最近的更新，包括诸如Hive、Sqoop和Avr0之类的新特性。它也提供了案例学习来展示Hadoop如何解决特殊问题。期待尽情享受你的数据？这就是你要的书。

书籍目录：

暂无相关目录，正在全力查找中！

作者介绍：

暂无相关内容，正在全力查找中

出版社信息：

暂无出版社相关信息，正在全力查找中！

书籍摘录：

暂无相关书籍摘录，正在全力查找中！

在线阅读/听书/购买/PDF下载地址：

在线阅读地址：Hadoop权威指南在线阅读

在线听书地址：Hadoop权威指南在线收听

在线购买地址：Hadoop权威指南在线购买

原文赏析：

* The architecture of HDFS is described in “The Hadoop Distributed File System” by Konstantin Shvachko,

Hairong Kuang, Sanjay Radia, and Robert Chansler (Proceedings of MSST2010, May 2010, http://

storageconference.org/2010/Papers/MSST/Shvachko.pdf).

† “Scaling Hadoop to 4000 nodes at Yahoo!,” http://developer.yahoo.net/blogs/hadoop/2008/09/scaling_hadoop

_to_4000_nodes_a.html.

在许多情况下，可以视Mapreduce为关系型数据库管理系统的补充。MapReduce比较适合以批处理的方式处理需要分析整个数据集的问题，尤其是即席分析。RDBMS适用于点查询和更新，数据集被索引后，数据库系统能够提供低延迟的数据检索和快速的少量数据更新。MapReduce适合数据一次写入、多次读取的应用，而关系型数据库更适合持续更新数据集.

MapReduce is a programming model for data processing. MapReduce works by breaking the processing into two phases: the map phase and the reduce phase. Each phase has key-value pairs as input and output, the types of which may be chosen by the programmer. The programmer also specifies two functions: the map function and the reduce function.

Hadoop divides the input to a MapReduce job into fixed-size pieces called input splits, or just splits. Hadoop creates one map task for each split, which runs the userdefined map function for each record in the split. Hadoop does its best to run the map task on a node where the input data resides in HDFS. This is called the data locality optimization.

When there are multiple reducers, the map tasks partition their output, each creating one partition for each reduce task. There can be many keys (and their associated values) in each partition, but the records for every key are all in a single partition. The partitioning can be controlled by a user-defined partitioning function, but normally the default partitioner—which buckets keys using a hash function—works very well.

HDFS is a filesystem designed for storing very large files with streaming data access patterns(write-once, read-many-times pattern), running on clusters of commodity hardware.

HDFS blocks(>64M) are large compared to disk blocks, and the reason is to minimize the cost of seeks. Map tasks in MapReduce normally operate on one block at a time, so if you have too few tasks (fewer than nodes in the cluster), your jobs will run slower than they could otherwise.

An HDFS cluster has two types of node operating in a master-worker pattern: a namenode (the master) and a number of datanodes (workers). The namenode manages the filesystem namespace. It maintains the filesystem tree and the metadata for all the files and directories in the tree. Datanodes are the workhorses of the filesystem. They store a...

One important aspect of this design is that the client contacts datanodes directly to retrieve data and is guided by the namenode to the best datanode for each block. This design allows HDFS to scale to a large number of concurrent clients, since the data traffic is spread across all the datanodes in the cluster.

Hadoop takes a simple approach in which the network is represented as a tree and the distance between two nodes is the sum of their distances to their closest common ancestor.