Section A — 1 Mark Questions
1. What is the core feature of Tuple Relational Calculus? [1 Mark]
Answer: It is a non-procedural query language that describes the desired information without specifying the sequence of operations.
2. In Domain Relational Calculus, what do variables represent? [1 Mark]
Answer: Variables represent domain elements (values) instead of entire tuples.
3. Define the purpose of the UNION operation. [1 Mark]
Answer: It combines the results of two queries and removes duplicate rows.
4. What does the INTERSECT operator return? [1 Mark]
Answer: It returns only the rows that are common to both input sets.
5. How does the EXCEPT operator function? [1 Mark]
Answer: It returns all rows from the first query that are not present in the second query.
6. Name one commonly used aggregate function. [1 Mark]
Answer: SUM is a commonly used aggregate function.
7. What is the result of applying the COUNT function? [1 Mark]
Answer: It returns the number of rows or values in the specified set.
8. Define a NULL value. [1 Mark]
Answer: A NULL value represents missing, unknown, or inapplicable data in a database field.
9. Does Query by Example (QBE) rely on a graphical interface? [1 Mark]
Answer: Yes, it is typically a visual, table-oriented query language.
10. What is Datalog based on? [1 Mark]
Answer: It is based on the logic programming paradigm.
11. Can aggregate functions operate on NULL values? [1 Mark]
Answer: Most aggregate functions ignore NULL values during calculation.
12. What does a quantifier 'exists' (∃) signify in relational calculus? [1 Mark]
Answer: It signifies that there is at least one tuple that satisfies the specified condition.
13. Which relational language treats rules as logical facts? [1 Mark]
Answer: Datalog.
14. Is the result of INTERSECT always a subset of both inputs? [1 Mark]
Answer: Yes.
15. What happens to duplicate rows in a SELECT statement without DISTINCT? [1 Mark]
Answer: Duplicates are retained.
16. Does the EXCEPT operation consider set order? [1 Mark]
Answer: No, relational operations are based on sets where order is not defined.
17. What does AVG(column) calculate? [1 Mark]
Answer: It calculates the arithmetic mean of the values in the specified column.
18. In Datalog, what is a predicate? [1 Mark]
Answer: It is a symbol representing a relation or a relationship between entities.
19. What does 'universal quantifier' (∀) imply? [1 Mark]
Answer: It implies that a condition must be true for all elements in the domain.
20. Define set compatibility in operations like UNION. [1 Mark]
Answer: The relations must have the same number of attributes and corresponding data types.
Section B — 2/3 Mark Questions
1. Differentiate between Tuple Relational Calculus and Domain Relational Calculus. [2 Marks]
Answer: Tuple Relational Calculus uses variables that range over entire tuples, whereas Domain Relational Calculus uses variables that range over individual attribute values.
2. Explain the behavior of aggregate functions with respect to NULL values. [2 Marks]
Answer: Generally, aggregate functions like SUM, AVG, and MAX ignore NULL values. However, the COUNT(*) function typically counts all rows, including those with NULL values.
3. Why are NULL values often problematic in relational databases? [3 Marks]
Answer: Firstly, they introduce three-valued logic (True, False, Unknown) which complicates queries. Secondly, they can cause ambiguity in mathematical operations. Finally, they require specialized handling in joins and constraints.
4. Describe the concept of Query by Example (QBE). [2 Marks]
Answer: QBE is a database query language that provides a user-friendly, visual interface where users fill in templates or tables to define the data they wish to retrieve.
5. What are the requirements for performing a UNION operation? [2 Marks]
Answer: The two relations involved must be union-compatible, meaning they must have the same number of attributes, and the domains of corresponding attributes must be identical.
6. Explain the basic structure of a Datalog rule. [3 Marks]
Answer: A Datalog rule consists of a head and a body separated by a ':-' symbol. The head defines the new relation being derived, and the body contains a list of predicates (goals) that must be satisfied for the head to be true.
7. Compare INTERSECT and EXCEPT. [3 Marks]
Answer: INTERSECT identifies elements common to both sets, effectively finding the overlap. EXCEPT identifies elements present in the first set but absent in the second, effectively subtracting the second set from the first.
8. What is the role of quantifiers in relational calculus? [2 Marks]
Answer: Quantifiers (existential ∃ and universal ∀) are used to specify whether a condition must hold for at least one tuple or for all tuples in a relation.
9. How do aggregate functions facilitate data analysis? [3 Marks]
Answer: They allow for the summarization of large datasets. By applying functions like MIN, MAX, or SUM, users can extract insights such as trends, totals, or extremes without processing every single record individually.
10. Explain the concept of set operations in relational languages. [2 Marks]
Answer: Set operations treat database relations as mathematical sets, allowing for the manipulation of relations through standard operations like union, intersection, and set difference.
Section C — 5 Mark Questions
1. Explain the principles of Tuple Relational Calculus (TRC) with examples. [5 Marks]
Answer:
Introduction
Tuple Relational Calculus is a non-procedural language where queries are expressed as formulas involving tuples. It focuses on declaring what data is needed rather than how to fetch it.
Principles
- TRC queries use the notation {t | P(t)}, where 't' is the tuple variable and 'P(t)' is a predicate logic formula.
- Predicates can involve conditions on attributes, such as t[name] = 'John'.
- The language allows existential (∃) and universal (∀) quantification to navigate data relationships.
Example
To find all employees earning over 50,000, the TRC expression is {t | E(t) ∧ t[salary] > 50000}, where E is the employee relation.
Conclusion
TRC provides a formal, logical foundation for relational databases, ensuring queries are declarative and mathematically sound.
2. Discuss the significance of NULL values and how they impact relational operations. [5 Marks]
Answer:
Introduction
A NULL value represents a state of unknown or inapplicable information, distinct from a zero or empty string.
Impact on Logic
The presence of NULL values leads to Three-Valued Logic (3VL): True, False, and Unknown. If a condition compares a value with NULL, the result is typically 'Unknown' rather than False.
Impact on Operations
- Joins: Rows containing NULL in join columns often fail to match, leading to unintended data loss in results.
- Aggregation: Most functions (e.g., SUM) ignore NULLs, which can skew averages if not anticipated.
- Constraints: PRIMARY KEY columns cannot contain NULL, ensuring entity integrity.
Summary
While NULLs handle missing data, they increase query complexity and require careful consideration during database design and maintenance.
3. Elaborate on the structure and utility of Datalog as a query language. [5 Marks]
Answer:
Introduction
Datalog is a declarative logic programming language used for database queries, closely related to Prolog but restricted to ensure termination.
Structure
A Datalog program consists of facts and rules. Facts are known data (e.g., parent(john, mary).), and rules describe how new data is derived from existing facts.
Utility
- Recursive Queries: Unlike standard SQL, Datalog handles recursion (e.g., finding all ancestors) very efficiently.
- Declarative Nature: It focuses on logical definitions, making it easier to verify complex data relationships.
- Integration: It bridges the gap between logic and database management, allowing complex reasoning over stored data.
Application
Datalog is primarily used in data integration, information extraction, and complex analytical systems where recursive relationships are frequent.
4. Describe the three primary set operations: UNION, INTERSECT, and EXCEPT. [5 Marks]
Answer:
Introduction
Relational languages use set-theoretic operations to combine or compare data stored in different tables.
Operation Details
- UNION: Combines rows from two queries. It effectively creates a single set containing all elements from either source. Duplicates are removed unless UNION ALL is specified.
- INTERSECT: Returns rows that exist in both query sets. It acts as a filter that only outputs matching records.
- EXCEPT: Retrieves rows found in the first set but not in the second. It is useful for identifying exclusions or differences between datasets.
Requirements
All three operations strictly require union-compatibility. The relations must have an equal number of columns, and the corresponding columns must share compatible data types.
Importance
These operations are essential for performing comparative analysis and merging fragmented information into a unified dataset.
5. Compare Tuple Relational Calculus (TRC) and Domain Relational Calculus (DRC). [5 Marks]
Answer:
Comparison Overview
Both are non-procedural languages serving as theoretical frameworks for relational algebra, but they operate on different fundamental units.
| Feature | Tuple Relational Calculus | Domain Relational Calculus |
|---|---|---|
| Unit of Operation | Entire Tuples | Individual Attribute Values |
| Variable Scope | Tuples within relations | Domains/Values of attributes |
| Logic Basis | Predicate logic on tuples | Predicate logic on values |
Detailed Explanation
- TRC Approach: Focuses on the tuple as a whole. For instance, to select a student, you define a tuple variable 't' and check properties like t[age] > 20.
- DRC Approach: Focuses on the domain of values. Instead of referring to the whole tuple, you use variables for specific attributes, such as
Conclusion
TRC is often closer to how SQL is structured, whereas DRC is closer to pure mathematical logic. Both are equally expressive and can perform the same database operations.