The purpose of primary keys in a DBMS is to uniquely identify each record in a table and maintain data integrity.

To store large amounts of data efficiently.

To create relationships between different tables.

To group similar records together in a table.

A candidate key can be any unique identifier, while a primary key is the selected candidate key used for record identification.

A primary key can have duplicate values, while a candidate key cannot.

A candidate key is always the primary key.

A candidate key is a foreign key in another table.

A foreign key is a type of index that speeds up queries.

A foreign key is a unique identifier for a table.

A foreign key is a field that contains only null values.

A foreign key is a field in a table that links to the primary key of another table, establishing a relationship between the two.

Data Redundancy

Data Normalization

Data Encryption

Entity Integrity, Referential Integrity, Domain Integrity, User-Defined Integrity

Sorting, Filtering, Grouping

Join, Aggregate, Distinct

Insert, Update, Delete

The basic operations of relational algebra are Selection, Projection, Union, Set Difference, Cartesian Product, and Rename.

The SELECT operation is used to delete data from a database.

The SELECT operation is significant for creating new tables in a database.

The SELECT operation is significant as it enables the retrieval of specific data from a database by applying conditions to filter rows.

The SELECT operation is primarily used for updating existing records in a database.

A JOIN operation merges two relations without any condition, resulting in a Cartesian product of both relations.

A JOIN operation combines two relations based on a common attribute, but it only includes all records from the first relation.

A JOIN operation in relational algebra is used to delete records from a relation based on a condition.

For example, consider two relations: Students (StudentID, Name) and Enrollments (StudentID, Course). An INNER JOIN on StudentID would produce a relation with tuples containing StudentID, Name, and Course for students who are enrolled in courses.

Domain relational calculus is a graphical interface for database queries.

Domain relational calculus is a non-procedural query language for databases that specifies queries using logical predicates.

Domain relational calculus is a type of database management system.

Domain relational calculus is a procedural programming language for databases.

Tuple relational calculus is based on set theory, while domain relational calculus is based on logic.

Tuple relational calculus uses individual attributes, while domain relational calculus uses tuples.

Tuple relational calculus allows for nested queries, while domain relational calculus does not.

Tuple relational calculus uses tuples, while domain relational calculus uses individual attributes.

To combine multiple relations into one.

To filter rows based on specific criteria.

To sort the data in ascending order.

To select specific columns from a relation.

The UNION operation subtracts one relation from another.

The UNION operation combines the results of two relations, removing duplicates.

The UNION operation creates a new relation by averaging the values of two relations.

The UNION operation merges two relations without removing duplicates.

The INTERSECT operation combines all tuples from two relations.

The INTERSECT operation sorts tuples in ascending order.

The INTERSECT operation retrieves common tuples from two relations.

The INTERSECT operation deletes duplicate tuples from a single relation.

Data integrity is maintained through primary keys, foreign keys, constraints, transactions, and regular backups.

Data integrity relies solely on user permissions and access control.

Data integrity is ensured by using only text files for storage.

Data integrity is maintained through regular software updates only.

Advantages of using relational algebra include formal query structure, optimization opportunities, and support for complex queries through basic operations.

Relational algebra is primarily used for data visualization.

It eliminates the need for database normalization.

Relational algebra is only useful for simple queries.

The UNION ALL operation combines two relations and includes all duplicates.

The UNION ALL operation removes all duplicates from the combined relations.

The UNION ALL operation is used to sort the results of two relations.

The UNION ALL operation creates a new relation by averaging the values of two relations.

Referential integrity ensures that relationships between tables remain consistent.

Referential integrity is only relevant for non-relational databases.

Referential integrity allows for duplicate entries in a table.

Referential integrity is a method for data encryption.

Aggregate functions allow for the calculation of summary statistics such as COUNT, SUM, AVG, MIN, and MAX.

Aggregate functions are used to sort data in ascending order.

Aggregate functions are primarily used for data entry validation.

Aggregate functions are only applicable to text data types.

The SET DIFFERENCE operation retrieves all tuples from the first relation that are not present in the second relation.

The SET DIFFERENCE operation combines two relations and includes all duplicates.

The SET DIFFERENCE operation is used to sort the results of two relations.

The SET DIFFERENCE operation creates a new relation by averaging the values of two relations.

A composite key is a combination of two or more columns that uniquely identifies a record in a table.

A composite key is a single column that serves as a unique identifier.

A composite key is used to create relationships between different tables.

A composite key is a type of foreign key that links to multiple tables.

The CARTESIAN PRODUCT operation combines all tuples from two relations, resulting in a relation that contains every possible pair of tuples.

The CARTESIAN PRODUCT operation filters tuples based on specific criteria.

The CARTESIAN PRODUCT operation is used to remove duplicates from a relation.

The CARTESIAN PRODUCT operation sorts the results of two relations.

The DISTINCT operation is used to eliminate duplicate rows from the result set of a query.

The DISTINCT operation is used to sort the results of a query.

The DISTINCT operation is used to group rows based on a specific column.

The DISTINCT operation is primarily for data entry validation.

Constraints enforce rules on data entry, ensuring that only valid data is stored in the database.

Constraints are used to speed up query execution.

Constraints are optional and do not affect data integrity.

Constraints are only relevant for non-relational databases.

The RENAME operation changes the name of a relation or its attributes.

The RENAME operation is used to delete a relation from the database.

The RENAME operation combines two relations into one.

The RENAME operation is used to sort the tuples in a relation.

The GROUP BY clause is used to aggregate data across multiple records based on a specified column.

The GROUP BY clause is used to filter records based on specific criteria.

The GROUP BY clause is used to sort the results of a query.

The GROUP BY clause is used to delete records from a table.

The PROJECT operation is used to retrieve specific columns from a relation, eliminating other columns.

The PROJECT operation combines two relations into one.

The PROJECT operation is used to delete records from a relation.

The PROJECT operation sorts the results of a relation.

The CHECK constraint ensures that all values in a column satisfy a specific condition.

The CHECK constraint is used to create relationships between tables.

The CHECK constraint allows for duplicate values in a column.

The CHECK constraint is only relevant for non-relational databases.

The CARTESIAN PRODUCT operation combines all tuples from two relations, resulting in a relation that contains every possible combination of tuples.

The CARTESIAN PRODUCT operation retrieves only unique tuples from two relations.

The CARTESIAN PRODUCT operation is used to filter records based on specific criteria.

The CARTESIAN PRODUCT operation sorts the results of two relations.

The ORDER BY clause is used to sort the result set of a query based on one or more columns.

The ORDER BY clause is used to filter records based on specific criteria.

The ORDER BY clause is used to group rows based on a specific column.

The ORDER BY clause is primarily for data entry validation.

The HAVING clause is used to filter records after aggregation has been performed.

The HAVING clause is used to sort the results of a query.

The HAVING clause is used to delete records from a table.

The HAVING clause is used to create new tables in a database.