Set difference, Database Management System

Assignment Help:

Set Difference

If R1 and R2 are two union compatible relations or relations then result of R3 =R1- R2 is the relation that have only those tuples that are in R1 but not in R2.

Incase, R3 will have tuples such that R3 = {t | R1 ∋ t ∧ t∉R2}.

 

Example:

 

R1

 

X

Y

A1

B1

A7

B7

A2

B2

A4

B4

 

 

 

  R2  

A

B

A1

B1

A2

B2

A3

B3

A4

B4

 

 

R1-R2 =

 

 

 

R1-R2 =

A

B

A3

B3

 

R2-R1=

 

 

 

R2-R1=

A

B

A7

B7

 

 

 

Note: -1) Difference operation is not commutative, i.e.,

 R1 - R2 ≠ R2 - R1

2) Difference operation is not associative, i. e.,

R1 - (R2 - R3) ≠ (R1 - R2) - R3


Related Discussions:- Set difference

Illustrate how customer relationship is promoted, FitAll Ltd is a company t...

FitAll Ltd is a company that manufactures clothes. Its processes are manual and there are stand-alone Information Systems that aid to manage them. The Information Systems were purc

What is functional dependency, What is Functional Dependency? A Functi...

What is Functional Dependency? A Functional dependency is shown by X Y among two sets of attributes X and Y that are subsets of R specifies a constraint on the possible tuple

What does data dictionary is a special file contains, What does data dictio...

What does data dictionary is a special file contains ? The data dictionary is a special file contain The name of all fields in all files.The width of all fields in all files an

Assignment, What are the typical phases of query processing

What are the typical phases of query processing

Join relation of two tuples, Consider the join of a relation R with relatio...

Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is: If R has m tuples and S has n tuples then maximum siz

Locking, define locking in simple language and decribed it

define locking in simple language and decribed it

Explain candidate key and super key, Explain Candidate Key and Super Key ...

Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher

A Biological Database on Viruses, How to create a biological database based...

How to create a biological database based on viruses. How to decide which attribute should be there in the table and schema? How to identify the primary keys, foreign keys, domain,

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

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