Intersection, Database Management System

Assignment Help:

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words, R3will have tuples such that R3 = {t | R1 ∋ t ∧ R2 ∋ t}.

Example:

 

 R1

A

B

A1

B1

A2

B2

A3

B3

A4

B4

  R2                     

A7

B7

X

Y

A1

B1

A7

B7

A2

B2

A4

B4

 

R3 = R1 ∩ R2 is

 

 

R3 = R1 ∩ R2 is

A

B

A1

B1

A2

B2

A4

B4

 

Note: 1) Intersection is an associative operation, i.e., R1 ∩ (R2 ∩ R3) = (R1 ∩ R2) ∩ R3

2) Intersection is a commutative operation, i.e., R1 ∩ R2 = R2 ∩ R1


Related Discussions:- Intersection

What are the disadvantages of relational approach, What are the disadvantag...

What are the disadvantages of relational approach? Disadvantages of relational approach: • Substantial hardware and system software overhead • May not fit all business models •

Implement a cache simulator, You are required to program (in a high level l...

You are required to program (in a high level language such as C, C++, Java) and implement a cache simulator which will have the following inputs and outputs:- INPUTS

Derived horizontal fragmentation, Derived horizontal fragmentation: Some ap...

Derived horizontal fragmentation: Some applications may include a join of two or more relations. If the relations are stored at dissimilar locations, there may be a major overhead

Data model in DBMS, how many types of data model in DBMS? explain data abst...

how many types of data model in DBMS? explain data abstraction with its different level

What is aggregate function, What is aggregate function? Briefly describe it...

What is aggregate function? Briefly describe it? Aggregate functions are functions that take a collection of values as input and return a one value. SQL offers 5 built-in aggre

Explain superkey, Explain Superkey Ans: A superkey is described in the ...

Explain Superkey Ans: A superkey is described in the relational model of database organization like a set of attributes of a relation variable for which it holds that in all re

Candidate keys, Super keys of a relation can have extra attributes. Candida...

Super keys of a relation can have extra attributes. Candidate keys are minimal super key, i.e. such a key have no extraneous attribute. An attribute is known as extraneous if even

Management information system, Explain the challenges before an E-business ...

Explain the challenges before an E-business management.

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