An approach to structural synthesis of data processing programs
An approach to the integration of the structural synthesis of programs and the synthesis of relations is proposed. The approach is based on a computation model (a set of formulas), describing both computations and navigation paths. The sound and complete system of inference rules for the class of formulas, used in such computation models, is given.
Unable to display preview. Download preview PDF.
- Armstrong, W.W. (1974). Dependency structures of database relationships. In Proc. IFIP 74, North-Holland, Amsterdam, pp. 580–583.Google Scholar
- Dikovskij, A.J., and M.J. Kanovich (1985). Computation models with separable subtasks. Proc. Acad. Sci. USSR, Techn. Cybernetics, 5, pp. 36–59 (in Russian).Google Scholar
- Honeyman, P. (1980) Extension joins. In Proc. 6th Int. Conf. Very Large Data Bases. (Montreal, Canada, Oct., 1–3, 1980). ACM, New York, pp. 239–244.Google Scholar
- Lozinskii, E.L. (1980). Construction of relations in relational databases. ACM Trans. Database Syst., 5, 2, pp. 208–224.Google Scholar
- Rissanen, J. (1977). Independent components of relations. ACM Trans. Database Syst., 2, 4, pp. 317–325.Google Scholar
- Tyugu, E.H., and M.J. Harf (1980). The algorithms of structural synthesis of programs. Programming, 4, pp. 3–13 (in Russian).Google Scholar