Efficient ELM-based two stages query processing optimization for big data (Q1665035)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient ELM-based two stages query processing optimization for big data |
scientific article; zbMATH DE number 6925820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient ELM-based two stages query processing optimization for big data |
scientific article; zbMATH DE number 6925820 |
Statements
Efficient ELM-based two stages query processing optimization for big data (English)
0 references
27 August 2018
0 references
Summary: MapReduce and its variants have emerged as viable competitors for big data analysis with a commodity cluster of machines. As an extension of MapReduce, ComMapReduce realizes the lightweight communication mechanisms to enhance the performance of query processing applications for big data. However, different communication strategies of ComMapReduce can substantially affect the executions of query processing applications. Although there is already the research work that can identify the communication strategies of ComMapReduce according to the characteristics of the query processing applications, some drawbacks still exist, such as relative simple model, too much user participation, and relative simple query processing execution. Therefore, an efficient ELM-based two stages query processing optimization model is proposed in this paper, named ELM to ELM ( \textit{E2E}) model. Then, we develop an efficient sample training strategy to train our \textit{E2E} model. Furthermore, two query processing executions based on the \textit{E2E} model, respectively, Just-in-Time execution and Queue execution, are presented. Finally, extensive experiments are conducted to verify the effectiveness and efficiency of the \textit{E2E} model.
0 references