MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides...
-
Upload
horace-thompson -
Category
Documents
-
view
217 -
download
0
Transcript of MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides...
![Page 1: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/1.jpg)
MapReduce and Data Management
Based on slides from Jimmy Lin’s lecture slides (http://www.umiacs.umd.edu/~jimmylin/cloud-2010-Spring/index.html) (licensed under Creation Commons Attribution 3.0 License)I used also some ideas from chapter 2 from the book by Anand Rajaraman and Jeff Ullman: "Mining of Massive Datasets“ (http://i.stanford.edu/~ullman/mmds.html)
![Page 2: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/2.jpg)
MapReduce Algorithm Design
![Page 3: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/3.jpg)
MapReduce: Recap• Programmers must specify:
map (k, v) → list(<k’, v’>)reduce (k’, list(v’)) → <k’’, v’’>– All values with the same key are reduced together
• Optionally, also:partition (k’, number of partitions) → partition for k’– Often a simple hash of the key, e.g., hash(k’) mod n– Divides up key space for parallel reduce operationscombine (k’, v’) → <k’, v’>*– Mini-reducers that run in memory after the map phase– Used as an optimization to reduce network traffic
• The execution framework handles everything else…
![Page 4: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/4.jpg)
combinecombine combine combine
ba 1 2 c 9 a c5 2 b c7 8
partition partition partition partition
mapmap map map
k1 k2 k3 k4 k5 k6v1 v2 v3 v4 v5 v6
ba 1 2 c c3 6 a c5 2 b c7 8
Shuffle and Sort: aggregate values by keys
reduce reduce reduce
a 1 5 b 2 7 c 2 9 8
r1 s1 r2 s2 r3 s3
![Page 5: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/5.jpg)
“Everything Else”• The execution framework handles everything else…
– Scheduling: assigns workers to map and reduce tasks
– “Data distribution”: moves processes to data
– Synchronization: gathers, sorts, and shuffles intermediate data
– Errors and faults: detects worker failures and restarts
• Limited control over data and execution flow
– All algorithms must expressed in m, r, c, p
• You don’t know:
– Where mappers and reducers run
– When a mapper or reducer begins or finishes
– Which input a particular mapper is processing
– Which intermediate key a particular reducer is processing
![Page 6: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/6.jpg)
Tools for Synchronization• Cleverly-constructed data structures
– Bring partial results together
• Sort order of intermediate keys– Control order in which reducers process keys
• Partitioner– Control which reducer processes which keys
• Preserving state in mappers and reducers– Capture dependencies across multiple keys and values
![Page 7: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/7.jpg)
Basic Hadoop API
• Mapper– void map(K1 key, V1 value, OutputCollector<K2, V2> output,
Reporter reporter)– void configure(JobConf job)
– void close() throws IOException• Reducer/Combiner
– void reduce(K2 key, Iterator<V2> values, OutputCollector<K3,V3> output, Reporter reporter)
– void configure(JobConf job)
– void close() throws IOException• Partitioner
– void getPartition(K2 key, V2 value, int numPartitions)
*Note: forthcoming API changes…
![Page 8: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/8.jpg)
Data Types in HadoopWritable Defines a de/serialization protocol.
Every data type in Hadoop is a Writable.
WritableComprable Defines a sort order. All keys must be of this type (but not values).
IntWritableLongWritableText…
Concrete classes for different data types.
SequenceFiles Binary encoded of a sequence of key/value pairs
![Page 9: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/9.jpg)
Scalable Hadoop Algorithms: Themes
• Avoid object creation– Inherently costly operation– Garbage collection
• Avoid buffering– Limited heap size– Works for small datasets, but won’t scale!
![Page 10: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/10.jpg)
Hadoop Map Reduce Example
• See the word count example from Hadoop Tutorial:
http://hadoop.apache.org/common/docs/current/mapred_tutorial.html#Overview
![Page 11: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/11.jpg)
Basic Cluster Components
• One of each:– Namenode (NN)– Jobtracker (JT)
• Set of each per slave machine:– Tasktracker (TT)– Datanode (DN)
![Page 12: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/12.jpg)
Putting everything together…
datanode daemon
Linux file system
…
tasktracker
slave node
datanode daemon
Linux file system
…
tasktracker
slave node
datanode daemon
Linux file system
…
tasktracker
slave node
namenode
namenode daemon
job submission node
jobtracker
![Page 13: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/13.jpg)
Anatomy of a Job• MapReduce program in Hadoop = Hadoop job
– Jobs are divided into map and reduce tasks– An instance of running a task is called a task attempt– Multiple jobs can be composed into a workflow
• Job submission process– Client (i.e., driver program) creates a job, configures it, and submits
it to job tracker– JobClient computes input splits (on client end)– Job data (jar, configuration XML) are sent to JobTracker– JobTracker puts job data in shared location, enqueues tasks– TaskTrackers poll for tasks– Off to the races…
![Page 14: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/14.jpg)
InputSplit
Source: redrawn from a slide by Cloduera, cc-licensed
InputSplit InputSplit
Input File Input File
InputSplit InputSplit
RecordReader RecordReader RecordReader RecordReader RecordReader
Mapper
Intermediates
Mapper
Intermediates
Mapper
Intermediates
Mapper
Intermediates
Mapper
Intermediates
Inp
utF
orm
at
![Page 15: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/15.jpg)
Source: redrawn from a slide by Cloduera, cc-licensed
Mapper Mapper Mapper Mapper Mapper
Partitioner Partitioner Partitioner Partitioner Partitioner
Intermediates Intermediates Intermediates Intermediates Intermediates
Reducer Reducer Reduce
Intermediates Intermediates Intermediates
(combiners omitted here)
![Page 16: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/16.jpg)
Source: redrawn from a slide by Cloduera, cc-licensed
Reducer Reducer Reduce
Output File
RecordWriter
Ou
tpu
tFo
rmat
Output File
RecordWriter
Output File
RecordWriter
![Page 17: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/17.jpg)
Input and Output• InputFormat:
– TextInputFormat
– KeyValueTextInputFormat
– SequenceFileInputFormat
– …
• OutputFormat:– TextOutputFormat
– SequenceFileOutputFormat
– …
![Page 18: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/18.jpg)
Shuffle and Sort in Hadoop• Probably the most complex aspect of MapReduce!
• Map side
– Map outputs are buffered in memory in a circular buffer
– When buffer reaches threshold, contents are “spilled” to disk
– Spills merged in a single, partitioned file (sorted within each partition): combiner runs here
• Reduce side
– First, map outputs are copied over to reducer machine
– “Sort” is a multi-pass merge of map outputs (happens in memory and on disk): combiner runs here
– Final merge pass goes directly into reducer
![Page 19: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/19.jpg)
Shuffle and SortMapper
Reducer
other mappers
other reducers
circular buffer (in memory)
spills (on disk)
merged spills (on disk)
intermediate files (on disk)
Combiner
Combiner
![Page 20: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/20.jpg)
Hadoop Workflow
Hadoop ClusterYou
1. Load data into HDFS
2. Develop code locally
3. Submit MapReduce job3a. Go back to Step 2
4. Retrieve data from HDFS
![Page 21: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/21.jpg)
On Amazon: With EC2
You
1. Load data into HDFS
2. Develop code locally
3. Submit MapReduce job3a. Go back to Step 2
4. Retrieve data from HDFS
0. Allocate Hadoop cluster
EC2
Your Hadoop Cluster
5. Clean up!
Uh oh. Where did the data go?
![Page 22: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/22.jpg)
On Amazon: EC2 and S3
Your Hadoop Cluster
S3(Persistent Store)
EC2(The Cloud)
Copy from S3 to HDFS
Copy from HFDS to S3
![Page 23: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/23.jpg)
Graph Algorithms in MapReduce
• G = (V,E), where– V represents the set of vertices (nodes)– E represents the set of edges (links)– Both vertices and edges may contain additional
information
![Page 24: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/24.jpg)
Graphs and MapReduce• Graph algorithms typically involve:
– Performing computations at each node: based on node features, edge features, and local link structure
– Propagating computations: “traversing” the graph
• Key questions:– How do you represent graph data in MapReduce?
– How do you traverse a graph in MapReduce?
![Page 25: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/25.jpg)
Representing Graphs
• G = (V, E)
• Two common representations– Adjacency matrix– Adjacency list
![Page 26: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/26.jpg)
Adjacency Matrices
Represent a graph as an n x n square matrix M– n = |V|
– Mij = 1 means a link from node i to j
1 2 3 41 0 1 0 12 1 0 1 13 1 0 0 04 1 0 1 0
1
2
3
4
![Page 27: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/27.jpg)
Adjacency Matrices: Critique
• Advantages:– Amenable to mathematical manipulation– Iteration over rows and columns corresponds to
computations on outlinks and inlinks
• Disadvantages:– Lots of zeros for sparse matrices– Lots of wasted space
![Page 28: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/28.jpg)
Adjacency Lists
Take adjacency matrices… and throw away all the zeros
1: 2, 42: 1, 3, 43: 14: 1, 3
1 2 3 41 0 1 0 12 1 0 1 13 1 0 0 04 1 0 1 0
![Page 29: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/29.jpg)
Adjacency Lists: Critique
• Advantages:– Much more compact representation– Easy to compute over outlinks
• Disadvantages:– Much more difficult to compute over inlinks
![Page 30: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/30.jpg)
Finding the Shortest Path
• Consider simple case of equal edge weights
• Solution to the problem can be defined inductively
• Here’s the intuition:
– Define: b is reachable from a if b is on adjacency list of a
– DISTANCETO(s) = 0
– For all nodes p reachable from s, DISTANCETO(p) = 1
– For all nodes n reachable from some other set of nodes M, DISTANCETO(n) = 1 + min(DISTANCETO(m), m M)
![Page 31: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/31.jpg)
Visualizing Parallel BFS
n0
n3n2
n1
n7
n6
n5n4
n9
n8
![Page 32: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/32.jpg)
From Intuition to Algorithm
• Data representation:– Key: node n– Value: d (distance from start), adjacency list (list of nodes reachable
from n)– Initialization: for all nodes except for start node, d =
• Mapper: m adjacency list: emit (m, d + 1)
• Sort/Shuffle– Groups distances by reachable nodes
• Reducer:– Selects minimum distance path for each reachable node– Additional bookkeeping needed to keep track of actual path
![Page 33: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/33.jpg)
Multiple Iterations Needed
• Each MapReduce iteration advances the “known frontier” by one hop– Subsequent iterations include more and more
reachable nodes as frontier expands– Multiple iterations are needed to explore entire
graph
• Preserving graph structure:– Problem: Where did the adjacency list go?– Solution: mapper emits (n, adjacency list) as well
![Page 34: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/34.jpg)
BFS Pseudo-Code
![Page 35: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/35.jpg)
Stopping Criterion
• How many iterations are needed in parallel BFS (equal edge weight case)?
• Convince yourself: when a node is first “discovered”, we’ve found the shortest path
• Now answer the question...– Six degrees of separation?
![Page 36: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/36.jpg)
Graphs and MapReduce• Graph algorithms typically involve:
– Performing computations at each node: based on node features, edge features, and local link structure
– Propagating computations: “traversing” the graph
• Generic recipe:
– Represent graphs as adjacency lists
– Perform local computations in mapper
– Pass along partial results via outlinks, keyed by destination node
– Perform aggregation in reducer on inlinks to a node
– Iterate until convergence: controlled by external “driver”
– Don’t forget to pass the graph structure between iterations
![Page 37: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/37.jpg)
Random Walks Over the Web• Random surfer model:
– User starts at a random Web page
– User randomly clicks on links, surfing from page to page
• PageRank
– Characterizes the amount of time spent on any given page
– Mathematically, a probability distribution over pages
• PageRank captures notions of page importance
– One of thousands of features used in web search
– Note: query-independent
![Page 38: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/38.jpg)
Given page x with inlinks t1…tn, where
– C(t) is the out-degree of t is probability of random jump– N is the total number of nodes in the graph
PageRank: Defined
n
i i
i
tC
tPR
NxPR
1 )(
)()1(
1)(
![Page 39: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/39.jpg)
Computing PageRank• Properties of PageRank
– Can be computed iteratively
– Effects at each iteration are local
• Sketch of algorithm:– Start with seed PRi values
– Each page distributes PRi “credit” to all pages it links to
– Each target page adds up “credit” from multiple in-bound links to compute PRi+1
– Iterate until values converge
![Page 40: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/40.jpg)
Simplified PageRank
• First, tackle the simple case:– No random jump factor– No dangling links
• Then, factor in these complexities…– Why do we need the random jump?– Where do dangling links come from?
![Page 41: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/41.jpg)
Sample PageRank Iteration (1)
n1 (0.2)
n4 (0.2)
n3 (0.2)n5 (0.2)
n2 (0.2)
0.1
0.1
0.2 0.2
0.1 0.1
0.066 0.0660.066
n1 (0.066)
n4 (0.3)
n3 (0.166)n5 (0.3)
n2 (0.166)Iteration 1
![Page 42: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/42.jpg)
Sample PageRank Iteration (2)
n1 (0.066)
n4 (0.3)
n3 (0.166)n5 (0.3)
n2 (0.166)
0.033
0.033
0.3 0.166
0.083 0.083
0.1 0.10.1
n1 (0.1)
n4 (0.2)
n3 (0.183)n5 (0.383)
n2 (0.133)Iteration 2
![Page 43: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/43.jpg)
PageRank in MapReduce
n5 [n1, n2, n3]n1 [n2, n4] n2 [n3, n5] n3 [n4] n4 [n5]
n2 n4 n3 n5 n1 n2 n3n4 n5
n2 n4n3 n5n1 n2 n3 n4 n5
n5 [n1, n2, n3]n1 [n2, n4] n2 [n3, n5] n3 [n4] n4 [n5]
Map
Reduce
![Page 44: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/44.jpg)
PageRank Pseudo-Code
![Page 45: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/45.jpg)
Complete PageRank• Two additional complexities
– What is the proper treatment of dangling nodes?– How do we factor in the random jump factor?
• Solution: – Second pass to redistribute “missing PageRank mass” and account
for random jumps
– p is PageRank value from before, p' is updated PageRank value– |G| is the number of nodes in the graph– m is the missing PageRank mass
p
G
m
Gp )1(
1'
![Page 46: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/46.jpg)
PageRank Convergence
• Alternative convergence criteria– Iterate until PageRank values don’t change– Iterate until PageRank rankings don’t change– Fixed number of iterations
• Convergence for web graphs?
![Page 47: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/47.jpg)
Beyond PageRank• Link structure is important for web search
– PageRank is one of many link-based features: HITS, SALSA, etc.
– One of many thousands of features used in ranking…
• Adversarial nature of web search– Link spamming– Spider traps– Keyword stuffing– …
![Page 48: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/48.jpg)
Efficient Graph Algorithms
• Sparse vs. dense graphs
• Graph topologies
![Page 49: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/49.jpg)
Figure from: Newman, M. E. J. (2005) “Power laws, Pareto distributions and Zipf's law.” Contemporary Physics 46:323–351.
Power Laws are everywhere!
![Page 50: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/50.jpg)
Local Aggregation
• Use combiners!– In-mapper combining design pattern also
applicable
• Maximize opportunities for local aggregation– Simple tricks: sorting the dataset in specific
ways
![Page 51: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/51.jpg)
Mapreduce and Databases
![Page 52: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/52.jpg)
Relational Databases vs. MapReduce
• Relational databases:
– Multipurpose: analysis and transactions; batch and interactive
– Data integrity via ACID transactions
– Lots of tools in software ecosystem (for ingesting, reporting, etc.)
– Supports SQL (and SQL integration, e.g., JDBC)
– Automatic SQL query optimization
• MapReduce (Hadoop):
– Designed for large clusters, fault tolerant
– Data is accessed in “native format”
– Supports many query languages
– Programmers retain control over performance
– Open source
Source: O’Reilly Blog post by Joseph Hellerstein (11/19/2008)
![Page 53: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/53.jpg)
Database Workloads• OLTP (online transaction processing)
– Typical applications: e-commerce, banking, airline reservations– User facing: real-time, low latency, highly-concurrent
– Tasks: relatively small set of “standard” transactional queries– Data access pattern: random reads, updates, writes (involving
relatively small amounts of data)• OLAP (online analytical processing)
– Typical applications: business intelligence, data mining– Back-end processing: batch workloads, less concurrency
– Tasks: complex analytical queries, often ad hoc– Data access pattern: table scans, large amounts of data involved per
query
![Page 54: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/54.jpg)
OLTP/OLAP Architecture
OLTP OLAP
ETL(Extract, Transform, and Load)
![Page 55: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/55.jpg)
OLTP/OLAP Integration
• OLTP database for user-facing transactions
– Retain records of all activity
– Periodic ETL (e.g., nightly)
• Extract-Transform-Load (ETL)
– Extract records from source
– Transform: clean data, check integrity, aggregate, etc.
– Load into OLAP database
• OLAP database for data warehousing
– Business intelligence: reporting, ad hoc queries, data mining, etc.
– Feedback to improve OLTP services
![Page 56: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/56.jpg)
OLTP/OLAP/Hadoop Architecture
OLTP OLAP
ETL(Extract, Transform, and Load)
Hadoop
Why does this make sense?
![Page 57: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/57.jpg)
ETL Bottleneck
• Reporting is often a nightly task:– ETL is often slow: why?– What happens if processing 24 hours of data takes longer than 24
hours?• Hadoop is perfect:
– Most likely, you already have some data warehousing solution– Ingest is limited by speed of HDFS– Scales out with more nodes– Massively parallel– Ability to use any processing tool– Much cheaper than parallel databases– ETL is a batch process anyway!
![Page 58: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/58.jpg)
MapReduce algorithms for processing relational data
![Page 59: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/59.jpg)
Relational Algebra
• Primitives
– Projection ()
– Selection ()
– Cartesian product ()
– Set union ()
– Set difference ()– Rename ()
• Other operations
– Join ( )⋈– Group by… aggregation
– …
![Page 60: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/60.jpg)
Projection
R1
R2
R3
R4
R5
R1
R2
R3
R4
R5
![Page 61: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/61.jpg)
Projection in MapReduce• Easy!
– Map over tuples, emit new tuples with appropriate attributes
– Reduce: take tuples that appear many times and emit only one version (duplicate elimination)
• Tuple t in R: Map(t, t) -> (t’,t’)
• Reduce (t’, [t’, …,t’]) -> [t’,t’]
• Basically limited by HDFS streaming speeds
– Speed of encoding/decoding tuples becomes important
– Relational databases take advantage of compression
– Semistructured data? No problem!
![Page 62: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/62.jpg)
Selection
R1
R2
R3
R4
R5
R1
R3
![Page 63: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/63.jpg)
Selection in MapReduce
• Easy!
– Map over tuples, emit only tuples that meet criteria
– No reducers, unless for regrouping or resorting tuples (reducers are the identity function)
– Alternatively: perform in reducer, after some other processing
• But very expensive!!! Has to scan the database– Better approaches?
![Page 64: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/64.jpg)
Union, Set Intersection and Set Difference
• Similar ideas: each map outputs the tuple pair (t,t). For union, we output it once, for intersection only when in the reduce we have (t, [t,t])
• For Set difference?
![Page 65: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/65.jpg)
Set Difference
- Map Function: For a tuple t in R, produce key-value pair (t, R), and for a tuple t in S, produce key-value pair (t, S).
- Reduce Function: For each key t, do the following.
1. If the associated value list is [R], then produce (t, t).
2. If the associated value list is anything else, which could only be [R, S], [S, R], or [S], produce (t, NULL).
![Page 66: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/66.jpg)
Group by… Aggregation
• Example: What is the average time spent per URL?
• In SQL:
– SELECT url, AVG(time) FROM visits GROUP BY url
• In MapReduce:
– Map over tuples, emit time, keyed by url
– Framework automatically groups values by keys
– Compute average in reducer
– Optimize with combiners
![Page 67: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/67.jpg)
Relational JoinsR1
R2
R3
R4
S1
S2
S3
S4
R1 S2
R2 S4
R3 S1
R4 S3
![Page 68: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/68.jpg)
Join Algorithms in MapReduce
• Reduce-side join
• Map-side join
• In-memory join– Striped variant– Memcached variant
![Page 69: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/69.jpg)
Reduce-side Join
• Basic idea: group by join key
– Map over both sets of tuples
– Emit tuple as value with join key as the intermediate key
– Execution framework brings together tuples sharing the same key
– Perform actual join in reducer
– Similar to a “sort-merge join” in database terminology
• Two variants
– 1-to-1 joins
– 1-to-many and many-to-many joins
![Page 70: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/70.jpg)
Map-side Join: Parallel Scans
• If datasets are sorted by join key, join can be accomplished by a scan over both datasets
• How can we accomplish this in parallel?
– Partition and sort both datasets in the same manner
• In MapReduce:
– Map over one dataset, read from other corresponding partition
– No reducers necessary (unless to repartition or resort)
• Consistently partitioned datasets: realistic to expect?
![Page 71: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/71.jpg)
In-Memory Join• Basic idea: load one dataset into memory, stream over other dataset
– Works if R << S and R fits into memory
– Called a “hash join” in database terminology
• MapReduce implementation
– Distribute R to all nodes
– Map over S, each mapper loads R in memory, hashed by join key
– For every tuple in S, look up join key in R
– No reducers, unless for regrouping or resorting tuples
![Page 72: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/72.jpg)
In-Memory Join: Variants• Striped variant:
– R too big to fit into memory?
– Divide R into R1, R2, R3, … s.t. each Rn fits into memory
– Perform in-memory join: n, Rn S⋈– Take the union of all join results
• Memcached join:– Load R into memcached
– Replace in-memory hash lookup with memcached lookup
![Page 73: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/73.jpg)
Memcached Join• Memcached join:
– Load R into memcached
– Replace in-memory hash lookup with memcached lookup
• Capacity and scalability?
– Memcached capacity >> RAM of individual node
– Memcached scales out with cluster
• Latency?
– Memcached is fast (basically, speed of network)
– Batch requests to amortize latency costs
Source: See tech report by Lin et al. (2009)
![Page 74: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/74.jpg)
Which join to use?
• In-memory join > map-side join > reduce-side join– Why?
• Limitations of each?– In-memory join: memory– Map-side join: sort order and partitioning– Reduce-side join: general purpose
![Page 75: MapReduce and Data Management Based on slides from Jimmy Lin’s lecture slides (jimmylin/cloud-2010-Spring/index.html) (licensed.](https://reader035.fdocuments.net/reader035/viewer/2022062516/56649d975503460f94a8067a/html5/thumbnails/75.jpg)
Processing Relational Data: Summary
• MapReduce algorithms for processing relational data:
– Group by, sorting, partitioning are handled automatically by shuffle/sort in MapReduce
– Selection, projection, and other computations (e.g., aggregation), are performed either in mapper or reducer
– Multiple strategies for relational joins
• Complex operations require multiple MapReduce jobs
– Example: top ten URLs in terms of average time spent
– Opportunities for automatic optimization