In modern large-scale distributed systems, analytics jobs submitted by various users often share similar work. Instead of optimizing jobs independently, multi-query optimization techniques can be employed to save a considerable amount of cluster resources. In this work, we introduce a novel method combining inmemory cache primitives and multi-query optimization, to improve the efficiency of data-intensive, scalable computing frameworks. By careful selection and exploitation of common (sub) expressions, while satisfying memory constraints, our method transforms a batch of queries into a new, more efficient one which avoids unnecessary recomputations. To find feasible and efficient execution plans, our method uses a cost-based optimization formulation akin to the multiple-choice knapsack problem. Experiments on a prototype implementation of our system show significant benefits of worksharing for TPC-DS workloads.
In-memory caching for multi-query optimization of data-intensive scalable computing workloads
DARLI-AP: 3rd International workshop on Data Analytics solutions for Real-LIfe APplications, in conjunction with EDBT/ICDT 2019, March 26-29, 2019, Libson, Portugal
PERMALINK : https://www.eurecom.fr/publication/5830