Abstract
A distributed database management system (DDBMS) manages a collection of data stored at various processing nodes of a computer network. Global queries are processed by DDBMS, and tasks (join operations in these queries) are assigned to various nodes in the network. Optimal allocation of these tasks are discussed, with reliability as the objective function and communication-cost as the constraint function. A model for reliability-based task allocation is developed. It is converted into a state-space search-tree and is implemented using a branch-and-bound algorithm. The query is considered as a multiple join problem (MJP). Reliable task-allocations for all permutations of MJP are found. The permutation which has minimum cost of data transmission is calculated. A method is suggested for calculating the reliability of the path that a DDBMS network follows to deliver a message to the receiver, given the number of spoolers.
Sign-in/Register to access full text options 
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.
