The document discusses randomness and the infinite monkey theorem through three key points: 1) With enough random combinations, even unlikely events become probable, like monkeys randomly typing Shakespeare. 2) Hadoop has near-linear scalability, allowing computational power and storage to increase predictably by simply adding more nodes, unlike relational databases. 3) This scalability provides business value by enabling applications to expand without massive engineering efforts or code rewrites.

1. Given Enough Monkeys
Some Thoughts on Randomness
Jesse Anderson | CLOUDERA, INSTRUCTOR

2. Infinite Monkey Theorem
2

3. Million Monkeys Algorithm
Randomly generate a 9 character group
TOBEORNOT
Does it exist in Shakespeare?
To be, or not to be- that is the question
3

4. Exponential Growth (aka Big Data)
Odds of finding a group Contiguous
Combinations
of characters is 1 in 26 Characters
raised to the power of
the number of 8 208,827,064,576
contiguous characters
9 5,429,503,678,976
10 141,167,095,653,376
4

5. Data Bias?
5

6. Hadoop Scalability
Percent of Linear Scalability
100
80
Percent
60 RDBMS
Hadoop
40
20
0
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Nodes RDBMS = Relational Database
6

7. Business Value of Scalability
Scaling does not require Adding more computers
massive re-engineering to cluster gets a
and complete rewrites of predictable increase in
code computational power and
storage
SAVE SAVE
7

8. Going Viral (and taking over the world)
Covered internationally 26,000 unique
in BBC, Wall Street visits from 119
Journal, Wired and countries in
Slashdot one day
8

9. @jessetanderson