Analysis of scheduling algorithms in data warehouse for query processing

Abstract

The data warehouse is a centralized repository for analyzing and storing huge amounts of data. In distributed data warehouse, data can be shared across multiple data repositories which belong to one or more organizations. In general, clients expect short response times for their queries. The scheduling algorithms are used to resolve the issues and to accomplish the task with quick manner. In this paper, we are dealing grid based scheduling algorithms for query scheduling and resource management in distributed data warehouses. The algorithms are Optimal Resource Constraints (ORC), Grouping based Fine-grained Job Scheduling (GFJS), Research on Novel Dynamic Resource Management (RNDRM) and New Resource Mechanism with Negotiate Solution (NRMNS).When we are combining both job and resource scheduling algorithms, the query processing time and memory size performances are lower than individual scheduling responses.

Reduce The Wastage of Data During Movement in Data Warehouse

“…MapReduce is a structure for capably handing out the investigation of big data on a huge amount of servers [4]. It was residential for the back end of Google's exploration to facilitate a big amount of goods servers to proficiently procedure the study of vast records of web pages composed from the entire above the globe [5] [6] [7].…”