Hadoop实战指南：分布式编程框架与 MapReduce入门

需积分: 10 49 浏览量更新于2024-07-25 收藏 5.09MB PDF 举报

《Hadoop in Action》是一本深入浅出的IT专业书籍，主要聚焦于Apache Hadoop分布式编程框架。本书分为三个部分，旨在帮助读者理解、配置和利用Hadoop技术进行高效的数据处理和分析。 **Part 1: Hadoop - A Distributed Programming Framework** - **Chapter 1: Introducing Hadoop** 本章是入门级内容，介绍了Hadoop的基本概念，包括其在大规模数据处理中的关键角色。它强调了Hadoop的可扩展性和分布式计算能力，适合处理海量数据。读者将学习到如何设计和编写能够应对复杂数据处理任务的程序。 - **Chapter 2: Starting Hadoop** 本章节着重于搭建Hadoop环境，包括硬件要求、软件安装和配置流程。读者将掌握如何在实际环境中设置一个运行的Hadoop集群，为后续开发做好准备。 - **Chapter 3: Components of Hadoop** 详细介绍了Hadoop的核心组件，如Hadoop Distributed File System (HDFS) 和 MapReduce，以及它们在整体架构中的作用。这有助于读者理解Hadoop的工作原理。 **Part 2: Hadoop in Action** 这部分深入探索Hadoop的实战应用： - **Chapter 4: Writing basic MapReduce programs** 初学者可以在这里学习如何编写基本的MapReduce程序，了解这两个核心操作（map和reduce）如何协同工作以处理大量数据。 - **Chapter 5: Advanced MapReduce** 针对有经验的开发者，本章涵盖了更复杂的MapReduce技巧和优化策略，帮助提升程序性能。 - **Chapter 6: Programming practices** 探讨编写高效、可维护的Hadoop代码的最佳实践，包括代码组织、错误处理和调试技巧。 - **Chapter 7: Cookbook** 提供了实用的编码示例和解决方案，帮助读者解决在实际项目中可能遇到的问题。 - **Chapter 8: Managing Hadoop** 讲解如何管理和维护Hadoop集群，包括监控、故障恢复和性能调优。 **Part 3: Hadoop Gone Wild** 这部分探讨了Hadoop在云环境下的应用以及与其他工具的集成： - **Chapter 9: Running Hadoop in the cloud** 讨论云计算环境下部署Hadoop的优势，以及如何利用云服务进行弹性扩展。 - **Chapter 10: Programming with Pig** Pig Latin语言简介，这是一种用于构建Hadoop MapReduce作业的高级接口，简化了复杂数据处理任务的编写。 - **Chapter 11: Hive and the Hadoop Herd** Hive作为Hadoop上的SQL查询引擎，以及如何使用Hadoop的其他工具（如Hive和Hadoop Streaming）来执行数据处理。 - **Chapter 12: Case studies** 通过实际案例分析，展示了Hadoop在企业级应用中的场景和效果，加深读者对理论知识的理解和实际应用的掌握。 **附录: HDFS file commands** 提供了关于Hadoop分布式文件系统(HDFS)的命令行操作指南，便于用户管理存储和访问大数据。《Hadoop in Action》不仅提供理论知识，还提供了丰富的实践指导，适合从新手到专家级别的读者全面学习和掌握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页未读，继续阅读

bignew

粉丝: 0
资源: 2

Hadoop实战指南：分布式编程框架与 MapReduce入门

Hadoop实战： Chuck Lam《Hadoop in Action》详解

Hadoop实战：Chuck Lam的《Hadoop in Action》文字版

Hadoop实战指南：Chuck Lam的《Hadoop in Action》

hadoop in action

Hadoop In Action

Hadoop in action

Manning出版社推荐：实战指南《Hadoop in Action》

Chuck Lam的《Hadoop in Action》中文版：入门与参考指南

白色大气风格的旅游酒店企业网站模板.zip

python实现用户注册

最新资源