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

What is a database, What is a database? At any given time, they're sto...

What is a database? At any given time, they're storing a tremendous amount of information - inventory, in the case of Amazon, messages and interrelationships in the case of Tw

A distributed transaction, A Distributed Transaction Let us demonstrate...

A Distributed Transaction Let us demonstrate the concept of a distributed transaction by considering a banking system having of three branches located in 3 different cities. Ev

What are the overlapping elements, What are the Overlapping elements O...

What are the Overlapping elements Overlapping elements can be found by scanning all the elements in front of deleted element in priority list for the sheet and comparing them

What is vertical fragmentation, What is vertical fragmentation? Vertica...

What is vertical fragmentation? Vertical fragmentation divides the relation by decomposing the scheme R of relation r.

Sequences-data control, Sequences Sequences: Automatically produ...

Sequences Sequences: Automatically produce unique numbers Are sharable Are typically used to make a primary key value Replace application code Speed up t

Stock market, need requirement analysis for database management of stock ma...

need requirement analysis for database management of stock market

Entity integrity constraint - relational constraints, It defines that no pr...

It defines that no primary key value can be null. This is as the primary key is used to recognize individual tuple in the relation. So we will not be able to recognize the records

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Define shared locks, Define Shared locks? Ans: Shared lock: Throughout ...

Define Shared locks? Ans: Shared lock: Throughout concurrent execution of transactions, earlier than a transaction can access a data item, it has to obtain a lock on it. Now he

Draw an entity-relationship model, Draw an Entity-Relationship model for ...

Draw an Entity-Relationship model for the relational schema given in the Appendix. Show all the entities, relationships, relationship names, and attributes and also underline the

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