Question 41
Which normal form requires that a relational table is in 3NF and every non-trivial functional dependency X -> Y has X as a super key?
BCNF is a stricter version of 3NF where for every functional dependency X -> Y, X must be a super key.
Which normal form requires that a relational table is in 3NF and every non-trivial functional dependency X -> Y has X as a super key?
BCNF is a stricter version of 3NF where for every functional dependency X -> Y, X must be a super key.
Which normal form eliminates partial dependencies on a composite primary key?
Second Normal Form (2NF) requires 1NF compliance and that all non-key attributes are fully dependent on the entire primary key.
In ACID properties of database transactions, 'A' stands for:
Atomicity ensures that a transaction completes entirely ('all') or not at all ('nothing').
Which concurrency control protocol guarantees Serializability by forcing transactions to acquire locks in two distinct phases?
2PL enforces a Growing Phase (acquiring locks) followed by a Shrinking Phase (releasing locks) to ensure serializability.
What type of key uniquely identifies a record in a table and cannot contain NULL values?
A Primary Key uniquely identifies tuples in a table and enforces entity integrity by prohibiting NULL values.