DYNAMIC FAULT TOLERANT DEPENDENCY SCHEDULING ALGORITHM FOR QUERY SCHEDULING IN DISTRIBUTED DATA WAREHOUSE

Data receiving capacity, storage, process time and availability relates to the organization’s success. Structured collection of data is called as database. In computing, many different operational databases are stored in a central repository known as a data warehouse accessed by reporting and data analysis applications. The volume of data will be distributed over multiple processors called as a technologically distributed data warehouse. This type of warehouses usually involves the most redundant data and complex loading and updating processes. If the volume of the data increased in the limit of a distributed processor, the other processor can be added to the network. As the amount of data and number of sites grows, often distributed system becomes crucial for scheduling the queries. The query scheduling process is very compact to accomplish these tasks within a few seconds. So here gird based task and resource scheduling algorithms have been used to resolve these issues.

KRISHNAVENI S