Union, intersection, difference in DBMS Theory - Full Explanation

Introduction

When working with sets of data, it is common to combine or compare them to find shared or unique elements. Understanding how to merge, find common parts, or differences between data sets helps organize and analyze information effectively.

Explanation

Union

Union combines all unique elements from two sets into one set. It includes every item that appears in either set, but without duplicates. This operation helps gather all possible values from both sources.

Union creates a set containing all distinct elements from both sets.

Intersection

Intersection finds only the elements that appear in both sets. It filters out anything that is not common to both, showing the shared data. This is useful to identify overlap or commonality between two groups.

Intersection returns only the elements present in both sets.

Difference

Difference takes one set and removes any elements that also appear in the second set. It shows what is unique to the first set by excluding shared items. This helps highlight what is exclusive to one group compared to another.

Difference shows elements in the first set that are not in the second set.

Real World Analogy

Imagine two friends each have a collection of books. Union is like putting all their books together on one shelf without repeating any title. Intersection is finding the books both friends own. Difference is seeing which books one friend has that the other does not.

Union → Combining all books from both friends without duplicates on one shelf

Intersection → Books that both friends have in their collections

Difference → Books that only one friend owns and the other does not

Diagram

Diagram

      ┌─────────────┐      ┌─────────────┐
      │   Set A     │      │   Set B     │
      │  {1, 2, 3}  │      │  {2, 3, 4}  │
      └─────┬───────┘      └─────┬───────┘
            │                    │
            │                    │
            │                    │
            │                    │
            ▼                    ▼
  ┌───────────────────────────────┐
  │ Union: {1, 2, 3, 4}           │
  │ Intersection: {2, 3}           │
  │ Difference (A - B): {1}        │
  └───────────────────────────────┘

This diagram shows two sets A and B with their elements and the results of union, intersection, and difference operations.

Key Facts

Union → Combines all unique elements from two sets into one set.

Intersection → Finds elements common to both sets.

Difference → Shows elements in the first set that are not in the second set.

Set → A collection of distinct elements with no duplicates.

Code Example

DBMS Theory

set_a = {1, 2, 3}
set_b = {2, 3, 4}

union = set_a.union(set_b)
intersection = set_a.intersection(set_b)
difference = set_a.difference(set_b)

print("Union:", union)
print("Intersection:", intersection)
print("Difference (A - B):", difference)

Common Confusions

Union includes duplicates from both sets.

Union includes duplicates from both sets. Union only includes unique elements; duplicates are removed.

Difference is symmetric between two sets.

Difference is symmetric between two sets. Difference is not symmetric; A - B is different from B - A.

Intersection returns all elements from both sets.

Intersection returns all elements from both sets. Intersection returns only elements present in both sets, not all elements.

Summary

Union merges two sets to include all unique elements from both.

Intersection finds only the elements shared by both sets.

Difference shows what is unique to the first set by removing elements found in the second.