Reference19 articles.
1. 1.ARMSTRONG W. W, Dependency Structures of Data Base Relationships, Proc. IFIP 74, 1974, pp. 580-583.4211210296.68038
2. 2.AUSIELLO G., D'ATRI A. and SACCA D.; Transitive Closure and Other Graph Algorithms for the Synthesis and Manipulation of Data Base Schemas, Graph theoretic Concepts in Computer Science, L.N.C.S., Vol. 100, 1981, pp. 212-223.6215020454.68122
3. 3.BATINI C. and D'ATRI A., Rewriting Systems as a Tool for Relational Data Base Design, Graph Grammars and their applications to Computer Science and Biology, L.N.C.S., Vol. 73, 1978 pp. 139-154.5650370402.68017
4. 4.BATINI C. and D'ATRI A., Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design, Graph Theoretic concepts in Computer Science, L.N.C.S., Vol. 100, 1981, pp. 177-194.6215000454.68121
5. 5.BEERI C., BERNSTEIN P. A. and GOODMAN N., A Sophisticate Introduction to Data Base Normalization Theory, Proc. 4th Int. Conf. on Very Large Data Bases, 1978, pp. 113-124.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The string generating power of context-free hypergraph grammars;Journal of Computer and System Sciences;1991-10
2. Strongly Equivalent Directed Hypergraphs;Analysis and Design of Algorithms for Combinatorial Problems;1985