Abstract
In this paper, the problem of determining an optimal file allocation in a distributed database is considered. The solution method is based on the isomorphism between the non-redundant file allocation problem and the “multiple choice constraints” knapsack problem, which is a well-known, classical problem of operations research. An ‘ad hoc’ branch and bound algorithm is then introduced for the redundant file allocation problem. Computational results showing the efficiency of the proposed technique are included.
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.
