Question 11
A minimal super key in a relational database table is called a -
A Candidate Key is defined as a minimal super key-a set of attributes that uniquely identifies tuples with no redundant attributes.
A minimal super key in a relational database table is called a -
A Candidate Key is defined as a minimal super key-a set of attributes that uniquely identifies tuples with no redundant attributes.
An attribute or set of attributes in a relation that refers to the primary key of another relation is a -
A Foreign Key establishes a logical link between two tables by pointing to the Primary Key of a referenced table, enforcing referential integrity.
Candidate keys that are NOT chosen as the primary key are known as -
Among all available candidate keys, the one selected to uniquely identify rows is the Primary Key; all remaining candidate keys become Alternate Keys.
Which relational algebra operation selects rows/tuples that satisfy a given condition?
The Selection operator ($\sigma, \sigma ) filters rows (tuples$) from a relation that satisfy a predicate or Boolean condition.
Which relational algebra operation selects specified columns/attributes from a relation?
The Projection operator (pi, $\pi ) extracts specified$ vertical columns (attributes) from a relation and eliminates duplicate rows from the result.