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

RDBMS, what is RDBMS? how it works? good example.

what is RDBMS? how it works? good example.

Explain the five levels of capability maturity models, Question 1 What is ...

Question 1 What is data mining? Write Data Mining applications Question 2 What is OLAP? Write the benefits of OLAP Question 3 What is Business Intelligence? Explai

What is boyce-code normal form, Boyce-Code Normal Form (BCNF) A relatio...

Boyce-Code Normal Form (BCNF) A relationship is said to be in BCNF if it is already in 3NF and the left hand side of each dependency is a candidate key. A relation who is in 3N

Explain recursive relationship type, Explain Recursive relationship type? ...

Explain Recursive relationship type? Recursive relationship type: A recursive relationship is one in that the similar entity participates more than once in the relationship

Explain about sql server 2000, What is the difference between SQL Server 2...

What is the difference between SQL Server 2000 complete and differential backups? A complete backup makes a copy of the whole database. A differential backup creates a copy of

Information system fundamentals, A full discription of the new, a discripti...

A full discription of the new, a discription of its components, and the bebefit it will provide a company. A disscussion of the information usedin the system. A disscussion of any

Lossless-join decomposition, Lossless-Join Decomposition   Let us sh...

Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

Determine the strong and weak entity, Determine the Strong and Weak Entity ...

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

Explain the deadlock avoidance, Define deadlock avoidance. An alternat...

Define deadlock avoidance. An alternative method for avoiding deadlocks is to needs additional information about how resources are to be requested. Each request requires the s

What do you understand by raid, What do you understand by RAID? Explain RA...

What do you understand by RAID? Explain RAID Level 4 and Level5? RAID - It is stands for Redundant Array of Inexpensive Disks (as named by the inventor), or alternatively Re

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