Scribd
Upload
20 views

Trivial and Non

A set of functional dependencies (FDs) can be either trivial or non-trivial. An irreducible set of FDs is a set where no FD can be removed without losing information about the dependencies between attributes.

Uploaded by

Jitendra Patel
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views

Trivial and Non

A set of functional dependencies (FDs) can be either trivial or non-trivial. An irreducible set of FDs is a set where no FD can be removed without losing information about the dependencies between attributes.

Uploaded by

Jitendra Patel
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Trivial and non-trivial FD

Set
Irreducible set of FD

You might also like