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

List some instances of collection types, List some instances of collection ...

List some instances of collection types? a) sets b) arrays c) multisets

Insulation between conceptual and physical structures, Insulation between c...

Insulation between conceptual and physical structures It can be defined as: 1. The Database Administrator should be capable to vary the storage structures without affectin

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

Data storage and retrieval services, An Enterprising group of Entrepreneurs...

An Enterprising group of Entrepreneurs introduced a new business named StoreItRite which is based on data storage and retrieval services. It provides the services and the company c

Explain er model, Question 1 Explain ER model Question 2 What are the...

Question 1 Explain ER model Question 2 What are the characteristics of a computer provided information? Question 3 What are facts and guidelines to be considered when se

What are advantages of using an index and disadvantages, What are the advan...

What are the advantages of by using an index and what are its disadvantages ? In difference, if the search key of a secondary index is not a candidate key, it is not sufficient

What is authorization graph, What is authorization graph? Passing of au...

What is authorization graph? Passing of authorization from single user to another can be shown by an authorization graph.

Explain the outer join, Define Outer join Outer join - If there are any...

Define Outer join Outer join - If there are any type of values in the one table that do not have corresponding value(s) in the other, in an equi-join which will not be selected

Dealing with constraints violation, If the deletion violates referential in...

If the deletion violates referential integrity constraint, then three alternatives are available: Default option: - refuse the deletion. It is the job of the DBMS to describ

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