Hadoop分布式编程指南

需积分: 0 115 浏览量更新于2024-07-25 收藏 5.05MB PDF 举报

Hadoop in Action Eng 版 Hadoop 是一个分布式编程框架，用于处理大规模数据。Hadoop in Action Eng 版是一本关于 Hadoop 的英文书籍，涵盖了 Hadoop 的基础知识、MapReduce 编程、Hadoop 集群管理等方面的内容。 Hadoop 概述 Hadoop 是一个开源的分布式计算框架，由 Doug Cutting 和 Mike Cafarella 于 2005 年创立。Hadoop 的名称来源于 Doug Cutting 的儿子的玩具象棋。Hadoop 的主要特点是可以处理大量数据，具有高可扩展性、可靠性和高性能。 Hadoop 架构 Hadoop 的架构主要由三个部分组成：HDFS（Hadoop Distributed File System）、MapReduce 和 YARN（Yet Another Resource Negotiator）。 * HDFS：HDFS 是 Hadoop 的分布式文件系统，负责存储和管理数据。 * MapReduce：MapReduce 是 Hadoop 的计算引擎，负责处理数据。 * YARN：YARN 是 Hadoop 的资源管理器，负责管理 Hadoop 集群的资源。 MapReduce 编程 MapReduce 是 Hadoop 的核心编程模型，用于处理大规模数据。MapReduce 编程模型包括两个阶段：Map 阶段和 Reduce 阶段。 * Map 阶段：Map 阶段负责将输入数据分割成小块，并对每个块进行处理。 * Reduce 阶段：Reduce 阶段负责将 Map 阶段的输出结果进行聚合和处理。 Hadoop 集群管理 Hadoop 集群管理是指对 Hadoop 集群的监控、管理和维护。Hadoop 集群管理包括集群规划、集群监控、故障恢复等方面。 Hadoop 在云计算中的应用 Hadoop 在云计算中的应用主要是指在云计算平台上部署和运行 Hadoop 集群。Hadoop 在云计算中的应用具有高可扩展性、灵活性和高性能。 Pig 和 Hive Pig 和 Hive 是 Hadoop 的两个高级编程语言，用于简化 Hadoop 应用开发。 * Pig：Pig 是一个基于 SQL 的高级编程语言，用于简化 Hadoop 应用开发。 * Hive：Hive 是一个基于 SQL 的高级编程语言，用于简化 Hadoop 应用开发。 Hadoop 案例研究 Hadoop 案例研究是指使用 Hadoop 解决实际问题的实践经验。Hadoop 案例研究涵盖了多个行业和领域，例如数据挖掘、机器学习、自然语言处理等。 Hadoop in Action Eng 版是一本涵盖了 Hadoop 的基础知识、MapReduce 编程、Hadoop 集群管理等方面的书籍，对于 Hadoop 初学者和开发者具有重要的参考价值。

14 C

HAPTER

1 Introducing Hadoop

for each value in values {

sum = sum + value;

}

emit ((String)token, (Integer) sum);

}

We’ve said before that the output of both map and reduce function are lists. As you

can see from the pseudo-code, in practice we use a special function in the framework

called emit() to generate the elements in the list one at a time. This emit() function

further relieves the programmer from managing a large list.

The code looks similar to what we have in section 1.5.1, except this time it will

actually work at scale. Hadoop makes building scalable distributed programs easy,

doesn’t it? Now let’s turn this pseudo-code into a Hadoop program.

1.6 Counting words with Hadoop—running your ﬁ rst program

Now that you know what the Hadoop and MapReduce framework is about, let’s get it

running. In this chapter, we’ll run Hadoop only on a single machine, which can be

your desktop or laptop computer. The next chapter will show you how to run Hadoop

over a cluster of machines, which is what you’d want for practical deployment. Run-

ning Hadoop on a single machine is mainly useful for development work.

Linux is the ofﬁ cial development and production platform for Hadoop, although

Windows is a supported development platform as well. For a Windows box, you’ll need

to install cygwin (http://www-cygwin.com/) to enable shell and Unix scripts.

NOTE

Many people have reported success in running Hadoop in development

mode on other variants of Unix, such as Solaris and Mac OS X . In fact,

MacBook Pro seems to be the laptop of choice among Hadoop developers, as

they’re ubiquitous in Hadoop conferences and user group meetings.

Running Hadoop requires Java (version 1.6 or higher). Mac users should get it from

Apple. You can download the latest JDK for other operating systems from Sun at

http://java.sun.com/javase/downloads/index.jsp. Install it and remember the root of

the Java installation, which we’ll need later.

To install Hadoop, ﬁ rst get the latest stable release at http://hadoop.apache.org/

core/releases.html. After you unpack the distribution, edit the script conf/hadoop-

env.sh to set JAVA_HOME to the root of the Java installation you have remembered

from earlier. For example, in Mac OS X, you’ll replace this line

# export JAVA_HOME=/usr/lib/j2sdk1.5-sun

with this line

export JAVA_HOME=/Library/Java/Home

You’ll be using the Hadoop script quite often. Let’s run it without any arguments to

see its usage documentation:

Counting words with Hadoop—running your ﬁ rst program 15

bin/hadoop

We get

Usage: hadoop [--conﬁ g confdir] COMMAND

where COMMAND is one of:

namenode -format format the DFS ﬁ lesystem

secondarynamenode run the DFS secondary namenode

namenode run the DFS namenode

datanode run a DFS datanode

dfsadmin run a DFS admin client

fsck run a DFS ﬁ lesystem checking utility

fs run a generic ﬁ lesystem user client

balancer run a cluster balancing utility

jobtracker run the MapReduce job Tracker node

pipes run a Pipes job

tasktracker run a MapReduce task Tracker node

job manipulate MapReduce jobs

version print the version

jar <jar> run a jar ﬁ le

distcp <srcurl> <desturl> copy ﬁ le or directories recursively

archive -archiveName NAME <src>* <dest> create a hadoop archive

daemonlog get/set the log level for each daemon

CLASSNAME run the class named CLASSNAME

Most commands print help when invoked w/o parameters.

We’ll cover the various Hadoop commands in the course of this book. For our current

purpose, we only need to know that the command to run a ( Java) Hadoop program is

bin/hadoop jar <jar>

. As the command implies, Hadoop programs written in Java

are packaged in jar ﬁ les for execution.

Fortunately for us, we don’t need to write a Hadoop program ﬁ rst; the default

installation already has several sample programs we can use. The following command

shows what is available in the examples jar ﬁ le:

bin/hadoop jar hadoop-*-examples.jar

You’ll see about a dozen example programs prepackaged with Hadoop, and one

of them is a word counting program called...

wordcount

! The important (inner)

classes of that program are shown in listing 1.2. We’ll see how this Java program

implements the word counting map and reduce functions we had in pseudo-code

in listing 1.1. We’ll modify this program to understand how to vary its behavior. For

now we’ll assume it works as expected and only follow the mechanics of executing a

Hadoop program.

Without specifying any arguments, executing

wordcount

will show its usage

information:

bin/hadoop jar hadoop-*-examples.jar wordcount

which shows the arguments list:

wordcount [-m <maps>] [-r <reduces>] <input> <output>

16 C

HAPTER

1 Introducing Hadoop

The only parameters are an input directory (

<input>

) of text documents you want to

analyze and an output directory (

) where the program will dump its output.

To execute

wordcount

, we need to ﬁ rst create an input directory:

mkdir input

and put some documents in it. You can add any text document to the directory. For

illustration, let’s put the text version of the 2002 State of the Union address, obtained

from http://www.gpoaccess.gov/sou/. We now analyze its word counts and see the

results:

bin/hadoop jar hadoop-*-examples.jar wordcount input output

more output/*

You’ll see a word count of every word used in the document, listed in alphabetical or-

der. This is not bad considering you have not written a single line of code yet! But, also

note a number of shortcomings in the included

wordcount

program. Tokenization

is based purely on whitespace characters and not punctuation marks, making States,

States., and States: separate words. The same is true for capitalization, where States and

states appear as separate words. Furthermore, we would like to leave out words that

show up in the document only once or twice.

Fortunately, the source code for

wordcount

is available and included in the

installation at src/examples/org/apache/hadoop/examples/WordCount.java. We

can modify it as per our requirements. Let’s ﬁ rst set up a directory structure for our

playground and make a copy of the program.

mkdir playground

mkdir playground/src

mkdir playground/classes

cp src/examples/org/apache/hadoop/examples/WordCount.java

➥

playground/src/WordCount.java

Before we make changes to the program, let’s go through compiling and executing

this new copy in the Hadoop framework.

javac -classpath hadoop-*-core.jar -d playground/classes

➥

playground/src/WordCount.java

jar -cvf playground/wordcount.jar -C playground/classes/ .

You’ll have to remove the output directory each time you run this Hadoop command,

because it is created automatically.

bin/hadoop jar playground/wordcount.jar

➥

org.apache.hadoop.examples.WordCount input output

Look at the ﬁ les in your output directory again. As we haven’t changed any program

code, the result should be the same as before. We’ve only compiled our own copy

rather than running the precompiled version.

Now we are ready to modify

WordCount

to add some extra features. Listing 1.2 is

a partial view of the WordCount.java program. Comments and supporting code are

stripped out.

Listing 1.2 WordCount.java

public class WordCount extends Conﬁ gured implements Tool {

public static class MapClass extends MapReduceBase

implements Mapper<LongWritable, Text, Text, IntWritable> {

private ﬁ nal static IntWritable one = new IntWritable(1);

private Text word = new Text();

public void map(LongWritable key, Text value,

OutputCollector<Text, IntWritable> output,

Reporter reporter) throws IOException {

String line = value.toString();

StringTokenizer itr = new StringTokenizer(line);

while (itr.hasMoreTokens()) {

word.set(itr.nextToken());

output.collect(word, one);

}

public static class Reduce extends MapReduceBase

implements Reducer<Text, IntWritable, Text, IntWritable> {

public void reduce(Text key, Iterator<IntWritable> values,

OutputCollector<Text, IntWritable> output,

Reporter reporter) throws IOException {

int sum = 0;

while (values.hasNext()) {

sum += values.next().get();

}

output.collect(key, new IntWritable(sum));

}

...

}

The main functional distinction between

WordCount.java

and our MapReduce pseudo-

code is that in

WordCount.java

map()

processes one line of text at a time whereas our

pseudo-code processes a document at a time. This distinction may not even be apparent

from looking at

WordCount.java

as it’s Hadoop’s default conﬁ guration.

The code in listing 1.2 is virtually identical to our pseudo-code in listing 1.1 though

the Java syntax makes it more verbose. The map and reduce functions are inside inner

classes of

WordCount

. You may notice we use special classes such as

LongWritable

IntWritable

, and

Text

instead of the more familiar

Long

Integer

, and

String

classes of Java. Consider these implementation details for now. The new classes have

additional serialization capabilities needed by Hadoop’s internal.

The changes we want to make to the program are easy to spot. We see

that

WordCount

uses Java’s

StringTokenizer

in its default setting, which tokenizes based

only on whitespaces. To ignore standard punctuation marks, we add them to the

StringTokenizer

’s list of delimiter characters:

StringTokenizer itr = new StringTokenizer(line, “ \t\n\r\f,.:;?![]`”);

Counting words with Hadoop—running your ﬁ rst program 17

剩余298页未读，继续阅读

lightning1616

粉丝: 1
资源: 1

Hadoop分布式编程指南

Hadoop权威指南中文版（第二版）+Hadoop in Action

Hadoop In Action2

Hadoop In Action 中文版

Hadoop in Action 完整版

Hadoop in action中文版.pdf

hadoop in action

Hadoop In Action

Hadoop in action

精细金属掩模板(FMM)行业研究报告 显示技术核心部件FMM材料产业分析与市场应用

【创新未发表】斑马算法ZOA-Kmean-Transformer-LSTM负荷预测Matlab源码 9515期.zip

最新资源

精细金属掩模板(FMM)行业研究报告显示技术核心部件FMM材料产业分析与市场应用