Show simple item record

dc.contributor.authorMahajan, Kshiteej
dc.contributor.authorChowdhury, Mosharaf
dc.contributor.authorAkella, Aditya
dc.contributor.authorChawla, Shuchi
dc.date.accessioned2018-11-12T15:04:55Z
dc.date.available2018-11-12T15:04:55Z
dc.date.issued2018-09-27
dc.identifier.citationTR1855en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/78832
dc.description.abstractModern data processing clusters are highly dynamic – both in terms of the number of concurrently running jobs and their resource usage. To improve job performance, recent works have focused on optimizing the cluster scheduler and the jobs’ query planner with a focus on picking the right query execution plan (QEP) – represented as a directed acyclic graph – for a job in a resource-aware manner, and scheduling jobs in a QEP-aware manner. However, because existing solutions use a fixed QEP throughout the entire execution, the inability to adapt a QEP in reaction to resource changes often leads to large performance inefficiencies. This paper argues for dynamic query re-planning, wherein we re-evaluate and re-plan a job’s QEP during its execution. We show that designing for re-planning requires fundamental changes to the interfaces between key layers of data analytics stacks today, i.e., the query planner, the execution engine, and the cluster scheduler. Instead of pushing more complexity into the scheduler or the query planner, we argue for a redistribution of responsibilities between the three components to simplify their designs. Under this redesign, we analytically show that a greedy algorithm for re-planning and execution alongside a simple max-min fair scheduler can offer provably competitive behavior even under adversarial resource changes. We prototype our algorithms atop Apache Hive and Tez. Via extensive experiments, we show that our design can offer a median performance improvement of 1.47× compared to state-of-the-art alternatives.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriestechnical reports;TR1855
dc.subjectBig-Data Systemsen_US
dc.subjectQuery Planningen_US
dc.subjectSchedulingen_US
dc.titleDynamic Query Re-Planning Using QOOPen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record