Computer Science
The operation whose result contains all pairs of tuples from the two relations, regardless of whether their attribute values match.
- Join
- Cartesian product
- Intersection
- Set difference
Answer
Cartesian product
Reason — In an unrestricted join or Cartesian product of two relations, all possible combinations are formed by pairing each row from the first table with every row from the second table, regardless of whether their attribute values match. This operation returns n1 * n2 rows, where n1 is the number of rows in the first table, and n2 is the number of rows in the second table.
Related Questions
What is the meaning of "HAVING" clause in SELECT query ?
- To filter out the summary groups
- To filter out the column groups
- To filter out the row and column values
- None of the mentioned
Where and Having clauses can be used interchangeably in SELECT queries ?
- True
- False
- Only in views
- With order by
Which SQL function is used to count the number of rows in a SQL query ?
- COUNT()
- NUMBER()
- SUM()
- COUNT(*)
Which of the following is not an aggregate function ?
- Avg
- Sum
- With
- Min