Efficient ELM-based two stages query processing optimization for big data
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.
- Sharing across multiple MapReduce jobs
- Learning ELM-tree from big data based on uncertainty reduction
- Efficient distributed query processing on large scale RDF graph data
- Modeling multiclass task-based applications on heterogeneous distributed environments
- Implementing and optimizing multiple group by query in a MapReduce approach
This page was built for publication: Efficient ELM-based two stages query processing optimization for big data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665035)
