Question:

If a relational decomposition is not dependency-preserving, which one of the following relational operators will be executed more frequently in order to maintain the dependencies?

Show Hint

When dealing with non-dependency-preserving decompositions in relational databases, join operations are essential to maintain the required functional dependencies, as they help in combining fragmented data that is needed for dependency enforcement.

Updated On: Apr 4, 2025

Selection
Projection
Join
Set union

Hide Solution

Verified By Collegedunia

The Correct Option is C

Solution and Explanation

In relational database theory, a relational decomposition is dependency-preserving if, after decomposing a relation, we can enforce all the functional dependencies without needing to perform a join operation. If the decomposition is not dependency-preserving, we need to perform additional operations to maintain the dependencies.
The Join operator is the most commonly used operator when dependencies need to be maintained. This is because, in a non-dependency-preserving decomposition, we often have to join relations to reconstruct the information required to enforce the dependencies.
Selection and Projection only reduce the size of the relation, but they do not help in preserving or enforcing dependencies.
Set union is not typically used to enforce dependencies.
Therefore, Join is the operator that will be executed more frequently to maintain dependencies in the absence of dependency-preserving decomposition.

Was this answer helpful?

Questions Asked in GATE DA exam

Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and
\[ E = \{(i,j) : 0 < j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:
- GATE DA - 2025
- Data Structures
View Solution

Consider the following pseudocode.

Create empty stack S
Set x = 0, flag = 0, sum = 0
Push x onto S
while (S is not empty){
    if (flag equals 0){
        Set x = x + 1
        Push x onto S
    }
    if (x equals 8):
        Set flag = 1
    if (flag equals 1){
        x = Pop(S)
        if (x is odd):
            Pop(S)
        Set sum = sum + x
    }
}
Output sum

The value of \( sum \) output by a program executing the above pseudocode is:

GATE DA - 2025
Data Structures

View Solution

Consider the following Python code snippet.

def f(a, b):
    if (a == 0):
        return b
    if (a % 2 == 1):
        return 2 * f((a - 1) / 2, b)
    return b + f(a - 1, b)

print(f(15, 10))

The value printed by the code snippet is 160 (Answer in integer).

GATE DA - 2025
Recursion