Cartesian product, Database Management System

Assignment Help:

If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative.

Degree (R3) =Degree of (R1) + Degree (R2).

In case, R3 will have tuples such that R3 = {t1 || t2 | R1 ∋ t1  ∧ R2 ∋ t2}.

Example:

R2

A

B

A1

B1

A2

B2

A3

B3

A4

B4

 

 

       R1                         

C

C1

C2

 
       

R3 = R1 × R2 is

 

A

B

C

A1

B1

C1

A1

B1

C2

A2

B2

C1

A2

B2

C2

A3

B3

C1

A3

B3

C2

A4

B4

C1

A4

B4

C2

 


Related Discussions:- Cartesian product

Modular growth, Modular growth: In distributed environments, it is simple t...

Modular growth: In distributed environments, it is simple to expand. Latest sites can be added to the network without affecting the operations of other sites, as they are somewhat

Describe the statement in sql which allows to change, Describe the statemen...

Describe the statement in SQL which allows to change the definition of a table? In SQL Alter statement is used to allow the changes the definition of a table.

Describe log based recovery, Describe log based recovery The most usabl...

Describe log based recovery The most usably structure for recording data base modification is the LOG the log is a sequence of log records recording all the update activities i

ENTITY DIAGRAMS IN FIRST NORMAL FORM, CAN SOMEONE HELP ME WITH ENTITY DIAGR...

CAN SOMEONE HELP ME WITH ENTITY DIAGRAMS IN FIRST NORMAL FORM?

Express the properties of strings, Express the properties of Strings? ...

Express the properties of Strings? Strings can be case sensitive (or not) which can change the outcome of string operations. You can evaluate whole strings \ just part

Explain the concept of two-phase locking, Explain the Concept of Two-phase ...

Explain the Concept of Two-phase Locking It concerns the positions of locking and unlocking operations in each transaction.  In this protocol every transaction issue lock and u

What are the technique to define a schema completely, What are the techniqu...

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

Er diagrams, in an organization several projects are undertaken. Each proje...

in an organization several projects are undertaken. Each project can employ one or more employees. Each employee can work on one or more projects. Each project is undertaken on the

What are the three data anomalies, What are the three data anomalies that a...

What are the three data anomalies that are likely to occur as a result of data redundancy?  Can data redundancy be completely eliminated in database approach?  Why or why not? A

Union - basic set operation, UNION If R1 and R2 are two union compatibl...

UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples

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