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 is called a query evaluation plan, What is called a query evaluation p...

What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.

Develop database academic assignment, Develop Database academic assignment ...

Develop Database academic assignment Project Description: For a provided set of instructions in a case study design Entity Relationship Diagram. - Entity Relationship Diag

Explain the check clause, Explain the Check Clause The CHECK clause is ...

Explain the Check Clause The CHECK clause is employed to at the end of a CREATE TABLE statement specify table constraints. This is known as table-based constraint because it ap

Develop network database ipad app, I want an iPad app that is a simple 1 pa...

I want an iPad app that is a simple 1 page form to complete with text. The Objective is to allow a few dozen people of the same organization (they're all on iPad) to open the app,

Define tuple variable, Define tuple variable Tuple variable is a type o...

Define tuple variable Tuple variable is a type of variable whose domain is the set of all tuples.

What is a merge sort, QUESTION (a) Using an appropriate example, explai...

QUESTION (a) Using an appropriate example, explain what is a recursive function? (b) Explain in detail the C++ function given below. void search2(int list[],int n,int ele

What is the candidate key for a table with columns, For problems 1-4, give ...

For problems 1-4, give all candidate keys for the tables with FDs specified.  Composite candidate keys must be put in parentheses, and candidate keys must be separated with commas

Log based recovery, Log based recovery: Let us first describe the term tran...

Log based recovery: Let us first describe the term transaction log in the context of DBMS. A transaction log is a record in DBMS that remains track of all the transactions of a dat

Explain concurrency problems, Question: a) There are three concurrency...

Question: a) There are three concurrency problems, i.e. three types of potential mistake which could occur if concurrency control is not properly enforced in the database syst

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

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