Abstract
The distributed data warehouse is mainly based on how the data are being processed and distinguish between dynamic and physically distributed systems. Finding the relevant information from a huge database is a very laborious process and consumes more time. This conflict is addressed using a query scheduling process in the distributed data warehouse is very compact to accomplish these tasks within a few seconds. In this paper, Dynamic Fault Tolerant Dependency Scheduling (DFTDS) algorithm has been proposed to schedule the queries based on their dependency and it automatically allocates the resources by checking the status of the virtual machine based on its acknowledgment. That is, reply to client/user queries in distributed data warehouse systems. Demonstration of the proposed DFTDS algorithm shows a significant reduction in query processing time and memory utilization compared to existing algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
