1 / 27

Restore ： R eusing results of mapreduce jobs

Restore ： R eusing results of mapreduce jobs. Jun Fan. Outline. Introduction to MapReduce. MapReduce and its implementations such as Hadoop are common in Facebook , Yahoo, and Google as well as smaller companies

keona
Download Presentation

Restore ： R eusing results of mapreduce jobs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Restore： Reusing results of mapreducejobs Jun Fan

  2. Outline

  3. Introduction to MapReduce • MapReduce and its implementations such as Hadoop are common in Facebook, Yahoo, and Google as well as smaller companies • Use high-level query languages such as Pig to express their complex analysis tasks. • Translate queries into workflows of MapReducejobs, output is stored in the distributed file system

  4. Introduction to MapReduce

  5. Introduction to MapReduce • High-level language translate an query into physical operators(Join, Select) • Embed all physical operators into mapper and reducer stages • Compiler generates code for each MapReduce job and passes it to the MapReducesystem • ReStoreextends this dataflow to reuse the output of physical operators

  6. Overview ReStore • ReStore improves the performance of workflows by storing the intermediate results and reusing them • Enable queries submitted at different times to share results • Built on top of dataflow language processors

  7. Overview ReStore • Reuse job outputs previously stored • Store the outputs of executed jobs for future reuse • Create more reuse opportunities by storing the outputs of sub-jobs • Selects the outputs of jobs to • Rewrites a MapReducejob and submits it to the MapReduce system to be executed.

  8. Overview ReStore

  9. Overview ReStore

  10. Overview ReStore

  11. Types of Result Reuse

  12. Types of Result Reuse • If all dependant jobs of Join are stored in the system, Ttotal(Join) = ET(Jobn) • Parts of the query execution plan are stored in the system

  13. Types of Result Reuse

  14. ReStore System Architecture • Input is a workflow of MapReducejobs generated by a dataflow system • Outputs are: • Amodified MapReduce workflow that exploits prior executed jobs stored by ReStore • Anew set of job outputs to store in the distributed file system.

  15. ReStore System Architecture • Repository to manage the stored MapReduce job outputs: • The physical query execution plan of the MapReduce job (Input, output, operators) • The filename of the output in the distributed file system, • Statistics about the MapReduce job and the frequency of use of this output by different workflows. (size of input and output, execution time)

  16. ReStore System Architecture

  17. Plan Matcher and Rewritere • Goal is to find physical plans in the repository that can be used to rewrite the input workflow • Before a job is matched against the repository, all other jobs that it depends on have to be matched and rewritten to use the job outputs stored in the repository

  18. Plan Matcher and Rewritere

  19. Plan Matcher and Rewritere • The flow: • Scan sequentially through the physical plans in the repository • Rewrite it to use the matched physical plan in the repository • After rewriting, a new sequential scan through the repository is started • If a scan does not find any matches, ReStore proceeds to matching the next MapReduce job in the workflow

  20. Plan Matcher and Rewritere • Two operators are equivalent if: • Their inputs are pipelined from operators that are equivalent or from thesamedata sets • They perform functions that produce the same output data

  21. Plan Matcher and Rewritere • ReStore uses the first match that it finds in the repository • Rules to order the physical plans in the repository • Plan A is preferred to plan B if all the operators in plan B have equivalent operators in plan A • The ratio between the size of the input data and output data and the execution time of the MapReducejob

  22. The Repository • Can we treat all possible sub-jobs as candidates? NO!!! • Require a substantial amount of storage the overhead of storing all • The intermediate data would considerably slow down the execution of the input MapReduce job

  23. The Repository • Two heuristics for choosing candidate sub-jobs: • Conservative Heuristic: Use the outputs of operators that are known to reduce their input size (Project, Filter) • Aggressive Heuristic: Use the outputs of operators that are known to be expensive (Project,Filter, Join, Group)

  24. The Repository

  25. The Repository • Rules to keep a candidate job in the repository: • The size of its output data is smaller than the size of its input data • There will be a reduction in execution time for workflows reusing this job

  26. The Repository • Rules to evict a candidate job in the repository: • Evict a job from the repository if it has not been reused within a window of time • Evict a job from the repository if one or more of its inputs is deleted or modified

  27. THANK YOU Questions!

More Related