candidate keys

Consider a relational database schema with a relation $R(A, B, C, D)$. If $\{A, B\}$ and $\{A, C\}$ are the only two candidate keys of the relation $R$, then the number of superkey...

Consider a relation R(A, B, C, D, E) with the following three functional dependencies. AB $$\to$$ C ; BC $$\to$$ D ; C $$\to$$ E; The number of superkeys in the relation R is _____...

Relation $$R$$ has eight attribution $$ABCDEFGH.$$ Fields of $$R$$ contain only atomic values. $$F = \left\{ {CH \to G,\,\,A \to BC,\,B \to CFH,\,\,E \to A,\,\,F \to EG} \right\}$$...

Consider the following relational schemes for a library database. Book ( Title, Author, Catalog_ no, Publisher, Year, Pr ice ) Collection ( Title, Author, Catalog no ) With in the...

The relation scheme student Performance (Name, CourseNo, RollNo, Grade) has the following functional dependencies: Name, courseNo $$\,\, \to \,\,$$ grade RollNo, courseNo $$\,\, \t...