The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Peter Kandzia, Margret Mangelmann. The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design. In Hartmut Noltemeier, editor, Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG 80, Bad Honnef, Germany, June 15-18, 1980. Volume 100 of Lecture Notes in Computer Science, pages 195-211, Springer, 1980.

The following publications are possibly variants of this publication:

The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base DesignPeter Kandzia, Margret Mangelmann. xp 1981:

runs on WebDSL