Abstract
The design of a distributed data base for a hierarchical computer system is investigated. If the transmission cost and storage cost can be calculated from linear cost functions, a data base can be decomposed based upon a simple figure of merit. Moreover, each file can be allocated individually. When the cost functions are nonlinear, a file allocation algorithm is proposed to allocate files which again is based upon a simple figure of merit. The decomposition problem for completely decentralized data bases is also considered.
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.
