By Topic

Analysis of scheduling algorithms in data warehouse for query processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Krishnaveni ; Dept. Computer Science Karpagam University, Coimbatore Tamil Nadu, India ; M. Hemalatha

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.

Published in:

Emerging Trends in Science, Engineering and Technology (INCOSET), 2012 International Conference on

Date of Conference:

13-14 Dec. 2012