Data base decomposition in a hierarchical computer system

  • Authors:
  • Shi-Kuo Chang

  • Affiliations:
  • IBM Watson Research Center, Yorktown Heights, New York and University of Illinois at Chicago Circle, Chicago, Illinois

  • Venue:
  • SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
  • Year:
  • 1975

Quantified Score

Hi-index 0.01

Visualization

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.