Intersection, Database Management System

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

Posted Date: 3/6/2013 5:45:16 AM | Location : United States







Related Discussions:- Intersection, Assignment Help, Ask Question on Intersection, Get Answer, Expert's Help, Intersection Discussions

Write discussion on Intersection
Your posts are moderated
Related Questions
Complete replication: It implies maintaining of a whole copy of the database at every site. Thus, the reliability & availability and performance for query response are maximized.

What are the different approaches for database design? There are two basic approaches for database design which are as follows: Attribute driven: It compiles a list of att

Give the reasons for allowing concurrency? The reasons for allowing concurrency is if the transactions run serially, a short transaction might have to wait for a preceding long

Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica

CAR SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice) This relation refers to options installed in cars (e.g., cruise control) that were sold at a de

Database design Database tables will be created for you on the Technology web server. The schema will be as follows. Please note that this is a simplified database structure, d

Express the following queries in SQL: (a) Write the SQL code that will create ALL the four tables given in the appendix. Your answer should not contain the primary key and

I want to fragment existing table using java code... help me..!!

Explain Clustering file organization (i) Determine if a record of file is physically ordered on a nonkey field - that does not comprise a different value for each record - that

Explain the following functions of Oracle with suitable examples: (i) To_Char( ) (ii) Count( ) (iii) Trim( ) (iv) Length( ) Ans: (i) To_char( ): The TO_CHAR function conver