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

Complexity- drawbacks of data distribution, Complexity : A distributed DBMS...

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

Entity relationship diagram, Ask questApollo Hospitals (AH) is a popular me...

Ask questApollo Hospitals (AH) is a popular medical service provider in Oman. AH wants to automate its business functions into an information system. The proposed information syst

find a non-redundant cover and canonical cove, Given the following set of ...

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

State the component diagram, State the Component Diagram A component d...

State the Component Diagram A component diagram represents a set of component and relationships among them. In a dynamic model, component diagram is used to model physical com

Greater potential for bugs and increased processing overhead, Greater poten...

Greater potential for bugs: Since the sites of a distributed system operate simultaneously, it is more complex to ensure the correctness of algorithms. The art of constructing dis

Explain about primary key, Explain about primary key Primary Key: It ...

Explain about primary key Primary Key: It is one of the candidate keys that are taken to be the recognizing key for the entire table. E.g. although there are two candidate ke

Databases and data warehouses , Databases and data warehouses both are data...

Databases and data warehouses both are databases and both contains number of rows and columns of tables containing data. Data warehouse is really different from databases because d

Data model, data models are being replaced over years. Reasons and why does...

data models are being replaced over years. Reasons and why does that happen?

Which file organization provides very fast access, Which file organization ...

Which file organization provides very fast access to any arbitrary record of a file? Hashed file organization provides very fast access to any arbitrary record of a file.

Problems of concurrent transactions-lost updates, Lost Updates : Suppose th...

Lost Updates : Suppose the two transactions T3 and T4 run simultaneously and they happen to be interleaved in the following way (suppose the initial value of X as 10000):

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