Skip to main content
Log in

A quadratic programming model for optimal data distribution

  • Part I. Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper, a quadratic programming model is developed to take into consideration a number of factors that can influence the process of optimal allocation of data among the nodes in a distributed database. The factors include communication costs, translation costs, congestion costs and storage costs. Beale's method is used to solve the resulting quadratic program. Some numerical examples are presented and the potentials of such an approach in the design and analysis of distributed databases are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Casey, R. G.:Allocation of a file in an information network. Proc. AFIP 1972 STCC, Vol. 40, AFIPS Press, Monvale, N.J., 1972, pp. 617–625.

    Google Scholar 

  2. Chang, P. Y.:Parallel processing and data driven implementation of a relational data base system. Proc. ACM annal Conf., Oct. 1976, pp. 314–318.

  3. Chu, W. W.:Optimal file allocation in a multicomputer information system. Information Processing 1968, North-Holland Pub. Co., Amsterdam, 1969, pp. 1219–1225.

    Google Scholar 

  4. CODASYL Data Base Task Group Report, Conf. Data Sys. Language, ACM, New York, 1971.

  5. Deppe, M. E. and Fry, J. P.:Distributed databases: a summary of research. Computer Network 1, 1976, pp. 130–138.

    Google Scholar 

  6. Fung, K. T. and Lam, C. M.:Some methods of distributing data in a distributed database. Proc. Louisiana Computer Exposition, Mar. 1979, pp. 79–99.

  7. Fung, K. T. and Lam, C. M.:Optimal data allocation in a distributed database. Proc. Trends and Applications: 1979, May 1979, pp. 111–116.

  8. Ghosh, S. P.:Distributing a data base with logical associations on a computer network for parallel searching. IEEE Trans. Software Eng., Vol. SE-2 (June 1976), pp. 106–113.

    Google Scholar 

  9. Kerschberg, L., Klug, A. and Tsichritzis, D.:A taxononomy of data models. Technical Report CSRG-70, Computer Systems Research Group, University of Toronto, Toronto, Ontario, May 1976.

    Google Scholar 

  10. Kurtzberg, J. M.:On the memory conflict problems in multiprocessor systems. IEEE Trans. Comp., Vol. C-23 (Mar. 1974), pp. 286–293.

    Google Scholar 

  11. Levin, K. D. and Morgan, H. L.:Optimizing distributed databases—a framework for research. Proc. AFIPS NCC, Vol. 44, June 1975, pp. 473–478.

    Google Scholar 

  12. Maryanski, F. J.:A survey of developments in distributed data base management systems. IEEE Computer, Feb. 1978, pp. 28–38.

  13. Morgan, H. L. and Levin, K. D.:Optimal program and data locations in computer networks. CACM 20 (May 1977), pp. 315–322.

    Google Scholar 

  14. Ramamoorthy, C. V. and Wah, B. W.:Data management in distributed databases. Proc. AFIPS NCC, Vol. 48, 1979, pp. 667–680.

    Google Scholar 

  15. Simmons, D.:Nonlinear Programming for Operations Research, Prentice-Hall, Englewood Cliffs, N.J., 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was partially supported by a grant from Natural Science and Engineering Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lam, C.M., Fung, K.T. A quadratic programming model for optimal data distribution. BIT 21, 294–304 (1981). https://doi.org/10.1007/BF01941464

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01941464

Keywords

Navigation