z-logo
Premium
A query execution scheduling scheme for Impala system
Author(s) -
Chen Ling,
Zhao Yuliang,
Yang Yi,
Lv Mingqi,
Chen Donghui,
Wu Yong,
Wang Jingchang
Publication year - 2017
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.4392
Subject(s) - computer science , query optimization , scheduling (production processes) , distributed computing , parallel computing , database , mathematical optimization , mathematics
Summary Impala system is an open source, analytic MPP database for Apache Hadoop. Impala system uses a query execution scheduling scheme that assigns near‐equal bytes retrieval tasks for different hosts to ensure system load balance. However, such “load balance” cannot guarantee a short response time for Impala system, when there are original loads in the system. Traditional query execution scheduling methods require either some assumptions or particular architecture, which cannot be directly used in Impala system. In this paper, we present a query execution scheduling scheme for Impala system. If the query fetches data from a single table, the scheme exploits the maximum flow algorithm. If the query fetches data from multiple tables, the scheme employs a cost‐based algorithm with heuristic pruning rules. In addition, we propose a cost model for Impala system, which considers parallel execution, communication cost, and cluster load. The performance of the proposed scheme is evaluated by the TPC‐DS benchmark, and experimental results show that the scheme can reduce the query response time by 10%‐30%.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here