论文信息 - Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes - 字舞流文

Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes

In this paper the graph formalism for the representation of relational data base schemes is presented.

Giorgio Ausiello | Alessandro D'Atri

[1] Philip A. Bernstein,et al. Computational problems related to the design of normal form relational schemas , 1979, TODS.

[2] Harry T. Hsu,et al. An Algorithm for Finding a Minimal Equivalent Graph of a Digraph , 1975, JACM.

[3] Joachim Biskup,et al. Synthesizing independent database schemas , 1979, SIGMOD '79.

[4] Carlo Batini,et al. Rewriting Systems as a Tool for Relational Data Base Design , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[5] Gerald L. Thompson,et al. An Algorithm for Finding a Minimum Equivalent Graph of a Digraph , 1969, J. ACM.