Introduction to MapReduce with Hadoop on Linux

When your data and work grow, and you still want to produce results in a
timely manner, you start to think big. Your one beefy server reaches its
limits. You need a way to spread your work across many computers. You
truly need to scale out.

In pioneer days they used oxen for heavy pulling, and when
one ox couldn't budge a log, they didn't try to grow a larger ox. We
shouldn't be trying for bigger computers, but for more systems of
computers.—Grace Hopper

Clearly, cluster computing is old news. What's changed? Today:

We collect more data than ever before.

Even small-to-medium-size businesses can benefit from tools like Hadoop and
MapReduce.

You don't have to have a PhD to create and use your own cluster.

Many decent free/libre open-source tools can help you easily cluster commodity
hardware.

Let me start with some simple examples that will run on one machine and
scale to meet larger demands. You can try them on your laptop and then
transition to a larger cluster—like one you've built with commodity
Linux machines, your company or university's Hadoop cluster or Amazon
Elastic MapReduce.

Parallel Problems

Let's start with problems that can be divided into smaller
independent units of work. These problems are roughly classified as
"embarrassingly parallel" and are—as the term
suggests—suitable for
parallel processing. Examples:

MapReduce by Example

MapReduce is a coding pattern that abstracts much of the tricky bits of
scalable computations. We're free to focus on the problem at hand, but
it takes practice. So let's practice!

Say you have 100 10GB log files from some custom
application—roughly a petabyte of data. You do a quick test and estimate
it will take your desktop days do grep every line (assuming you even could
fit the data on your desktop). And, that's before you add in logic to
group by host and calculate totals. Your tried-and-true shell utilities
won't help, but MapReduce can handle this without breaking a sweat.

First let's look at the raw data. Log lines from the custom application
look like this:

The log format is hostname, colon, message. Your boss suspects someone
evil is trying to brute-force attack the application. The same host
trying many different user names may indicate an attack. He wants totals
of "invalid user" messages grouped by hostname. Filtering the above
log lines should yield:

dsl5.example.com 3

With gigabytes of log files, your trusty shell tools do just fine. For a
terabyte, more power is needed. This is a job for Hadoop and MapReduce.

Before getting to Hadoop, let's summon some Python and test locally on a
small dataset. I'm assuming you have a recent Python installed. I tested
with Python 2.7.3 on Ubuntu 12.10.

The first program to write consumes log lines from our custom
application. Let's call it map.py:

reduce.py totals up consecutive lines of a particular host. Let's assume
lines are grouped by hostname. If we see the same hostname, we increment
a total. If we encounter a different hostname, we print the total so
far and reset the total and hostname. When we exhaust standard input, we
print the total if necessary. This assumes lines with the same hostname
always appear consecutively. They will, and I'll address why later. Test
by piping it together with map.py like so:

chmod 755 reduce.py
./map.py < log.txt | sort | ./reduce.py

Later, I'll explain why I added sort to the pipeline. This prints:

dsl5.example.com 3

Exactly what we want. A successful test! Our test log lines contain three
"invalid user" messages for the host dsl5.example.com. Later we'll get
this local test running on a Hadoop cluster.

Let's dive a little deeper. What exactly does map.py do? It transforms
unstructured log data into tab-separated key-value pairs. It emits a
hostname for a key, a tab and the number 1 for a value (again, only for
lines with "invalid user" messages). Note that any number of log lines
could be fed to any number of instances of the map.py program—each line
can be examined independently. Similarly, each output line of map.py
can be examined independently.

Output from map.py becomes input for reduce.py. The output of reduce.py
(hostname, tab, number) looks very similar to its input. This is by
design. Key-value pairs may be reduced multiple times, so reduce.py
must handle this gracefully. If we were to re-reduce our final answer,
we would get the exact same result. This repeatable, predictable behavior
of reduce.py is known as idempotence.

We just tested with one instance of reduce.py, but you could imagine
many instances of reduce.py handling many lines of output from
map.py. Note that this works only if lines with the same hostname appear
consecutively. In our test, we enforce this constraint by adding sort
to the pipeline. This simulates how our code behaves within Hadoop
MapReduce. Hadoop will group and sort input to reduce.py similarly.

We don't have to bother with how execution will proceed and how many
instances of map.py and reduce.py will run. We just follow the MapReduce
pattern and Hadoop does the rest.

"Say you have 100 10GB log files from some custom application—roughly a petabyte of data. You do a quick test and estimate it will take your desktop days do grep every line (assuming you even could fit the data on your desktop)." That's a huge amount of time, and not so accurate testing.

You can strive them on your laptop computer and so transition to a bigger cluster—like one you've got engineered with goods UNIX system machines, your company or university's Hadoop cluster or Amazon Elastic MapReduce.

If you would like wager on-line then this pokies have all the top internet gambling games.