English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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 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. KeywordsWarehouse, Random Scheduling (RS), Optimal Resource Constraints (ORC), Grouping based Fine-grained Job Scheduling (GFJS), Heuristic Algorithm (HA), Dynamic Task Dependency Scheduling (DTDS)

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