Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 739 |
which of the following desired features are beyond the capability of relational algebra?
| Aggregate Computation | |
| Multiplication | |
| Finding transitive closure | |
| All of the above |
Question 739 Explanation:
● Aggregate Computation is a a function to a collection of values to generate a single result.
● Multiplication means cartesian product
●Transitive closure:
Given a domain D, let binary relation R be a subset of D×D. The transitive closure R + of R is the smallest subset of D×D that contains R and satisfies the following condition:
∀ x∀y∀z((x, y ) ∈ R + ⋀ ( y, z ) ∈ R + ⇒ ( x, z ) ∈ R + )
● Multiplication means cartesian product
●Transitive closure:
Given a domain D, let binary relation R be a subset of D×D. The transitive closure R + of R is the smallest subset of D×D that contains R and satisfies the following condition:
∀ x∀y∀z((x, y ) ∈ R + ⋀ ( y, z ) ∈ R + ⇒ ( x, z ) ∈ R + )
Correct Answer: D
Question 739 Explanation:
● Aggregate Computation is a a function to a collection of values to generate a single result.
● Multiplication means cartesian product
●Transitive closure:
Given a domain D, let binary relation R be a subset of D×D. The transitive closure R + of R is the smallest subset of D×D that contains R and satisfies the following condition:
∀ x∀y∀z((x, y ) ∈ R + ⋀ ( y, z ) ∈ R + ⇒ ( x, z ) ∈ R + )
● Multiplication means cartesian product
●Transitive closure:
Given a domain D, let binary relation R be a subset of D×D. The transitive closure R + of R is the smallest subset of D×D that contains R and satisfies the following condition:
∀ x∀y∀z((x, y ) ∈ R + ⋀ ( y, z ) ∈ R + ⇒ ( x, z ) ∈ R + )