Set Operations: Union

• Union: trick is to eliminate duplicates

  • Via sorting: sort R and S separately
    • use all attributes as the sort key
    • duplicates can be eliminated during the final merge phase
  • Via hashing: Partition R and S using the same hash function, using all attributes
    • Rehash corresponding partitions using a different function to detect duplicates

Previous slide

Next slide

Back to first slide

View graphic version