Union - basic set operation, Database Management System

Assignment Help:

UNION

If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both.

In case, R3 will have tuples such that R3 = {t | R1 ∋ t ∨ R2 ∋ t}.

Example

R1                                                                               

 

X

Y

A1

B1

A7

B7

A2

B2

A4

B4

R2

A

B

A1

B1

A2

B2

A3

B3

A4

B4

R3 = R1 ∪ R2 is

 Q

A

B

A1

B1

A2

B2

A3

B3

A4

B4

A7

B7

 

 

Note:  1) Union is a commutative operation, i.e, R ∪ S = S ∪ R.

2) Union is an associative operation, i.e.

R ∪ (S ∪ T) = (R ∪ S) ∪ T.


Related Discussions:- Union - basic set operation

Entities, Entities Let us first be aware of the question: What are e...

Entities Let us first be aware of the question: What are entities? An entity is an object of concern used to show the things in the actual world, e.g., table, car, bo

Design a large scale system, Question: (a) Why is it important to know...

Question: (a) Why is it important to know the architecture rather than to start requirement capture when designing a large scale system? (b) Who are the different people in

Unrepeatable reads-problems of concurrent transactions, Unrepeatable reads ...

Unrepeatable reads : Assume T7 reads X twice during its implementation. If it did not update X itself it could be very disturbing to see a dissimilar value of X in its next read. B

Explain physical and logical independence, Define Physical and Logical inde...

Define Physical and Logical independence  Ans: Physical data independence: The ability to modify physical level without causing application program to be rewritten. Logic

What is called as an n-way merge, What is called as an N-way merge? The...

What is called as an N-way merge? The merge operation is a generalization of the two-way merge used by the standard in-memory sort-merge algorithm. It merges N runs, so it is k

Define cardinality and participation constraints, Define cardinality and pa...

Define cardinality and participation constraints on a relationship type, completeness constraint on generalization.        Ans: Cardinality defines the number of entities to wh

Log, what is the need of a log in dbms

what is the need of a log in dbms

Record based logical models, Record based Logical Models: Use records as th...

Record based Logical Models: Use records as the key data representation components Examples: Relational Model: It shows data as well as relationship between data in the form

Serialisability, Serialisability: Any schedule that makes the similar resul...

Serialisability: Any schedule that makes the similar results as a serial schedule is known as a serialisable schedule. But how can a schedule are determined to be serialisable or n

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd