In another class having 2 sections, the two respective class representatives have prepared 2 separate Sports Preferences tables, as shown below:
Sports preference of section 1 (arranged on roll number column)
Table: Sports Preferences
| Roll_no | Sports |
|---|---|
| 9 | Cricket |
| 13 | Football |
| 17 | Badminton |
| 21 | Hockey |
| 24 | Cricket |
Sports preference of section 2 (arranged on Sports name column, and column order is also different)
Table: Sports Preferences
| Sports | Roll_no |
|---|---|
| Badminton | 17 |
| Cricket | 9 |
| Cricket | 24 |
| Football | 13 |
| Hockey | 21 |
Are the states of both the relations equivalent? Justify.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →Yes, both relations are equivalent because they contain identical data; relational tables are defined by their content (rows and columns), not by the physical order of rows or columns.
Understanding Relational Equivalence
This question tests a fundamental principle of the relational model: what makes two relations the same?
In relational database theory, a relation (table) is defined as a set of tuples (rows) over a set of attributes (columns). Two critical properties follow from this mathematical definition:
1. Row order is irrelevant
A relation is a set of tuples, and sets have no inherent ordering. The first table is sorted by Roll_no, the second by Sports, but this physical arrangement doesn't change the logical content. Think of it like two decks of cards containing the same cards but shuffled differently — they're still the same deck.
2. Column order is irrelevant
Each tuple is formally a mapping from attribute names to values. Whether you write (Roll_no: 9, Sports: Cricket) or (Sports: Cricket, Roll_no: 9), you're describing the same fact. The column sequence in the physical layout is just a display choice.
Verifying the Equivalence
Let's normalize both tables to a standard form (say, sorted by Roll_no, columns as Roll_no, Sports) and compare:
Section 1 (already in this form):
| Roll_no | Sports |
|---|---|
| 9 | Cricket |
| 13 | Football |
| 17 | Badminton |
| 21 | Hockey |
| 24 | Cricket |
Section 2 (reordered):
| Roll_no | Sports |
|---|---|
| 9 | Cricket |
| 13 | Football |
| 17 | Badminton |
| 21 | Hockey |
| 24 | Cricket |
Row-by-row, they match perfectly. Every tuple in Section 1 appears in Section 2, and vice versa. The cardinality (5 rows) is identical, the schema is identical (Roll_no, Sports), and the data content is identical.
Two relations are equivalent if and only if:
- They have the same set of attributes (column names and types)
- They contain exactly the same set of tuples (rows)
Physical ordering — of rows or columns — does not affect logical equivalence. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.