Query Processing in Distributed Data Warehouse using Proposed Dynamic Task Dependency Scheduling Algorithm

S. Krishnaveni, M. Hemalatha
2012 International Journal of Computer Applications  
A data warehouse is an electronic storage of huge amounts of data. It is also a system for retrieving and managing a data. In distributed data warehouse, data can be shared across multiple data repositories. Each may belong to one or more organizations. Query sorting is the problem of formatting the number of queries to be selected together. Reducing the usual completion period of a random order is a common concern. In this paper we propose Dynamic Task Dependency Scheduling (DTDS) Algorithm
more » ... (DTDS) Algorithm for query scheduling. Here our proposed algorithm takes the arrival time, size and also it considers the query dependency from the given query. It is also adaptable for all distributed data warehouse systems. Performance results show that the proposed algorithm gives less processing time and minimum query cost compared to others.
doi:10.5120/8774-2711 fatcat:h4g5tjgcizfpbfuqzstdxrxaku