Define union compatibility, Database Management System

Assignment Help:

Define union compatibility? Explain why INTERSECTION of two relations cannot be performed if they are not union compatible?

Two relations R(A1, A2,-------, An) and S(B1, B2,-----, Bn) are said t union compatible if they have the similar degree n and if dom (A) = dom(B) for all i=1---ni i Intersection needs two relations to be union compatible since or else it is not probable to formulate the criterion as to on what basis will attributes be considered as general.


Related Discussions:- Define union compatibility

What are wait-for-graphs, What are wait-for-graphs?Give the algorithm to co...

What are wait-for-graphs?Give the algorithm to construct a wait-for-graph from a given schedule of transactions? How can deadlocks be detected from wait-for-graphs?   Ans:  The

Sorting field groups we cannot use more than one key field, While sorting f...

While sorting field groups we cannot use more than one key field False.

Data replication, Data Replication "If a relation R has its copies kept...

Data Replication "If a relation R has its copies kept at two or more sites, then it is considered replicated". But why do we replicate a relation? There are several advan

Explain the operation of the data warehouse, Using a labelled diagram expla...

Using a labelled diagram explain the operation of the Data Warehouse, define the basic architectural components and outline the main functionalities. Briefly explain the role an op

The structured query language, The Structured Query Language INTRODUCT...

The Structured Query Language INTRODUCTION Database is an organised set of information about an entity having controlled redundancy and serves numerous applications. DBMS

Determine the statement- state as location within a program, State as Locat...

State as Location within a Program In this traditional approach, location of control inside a program totally defines the program state. Any finite state machine may be implem

Write expressions in relational algebra, Given the subsequent relations: ...

Given the subsequent relations:    vehicle (reg_no, make, colour)    Person (eno, name, address)    Owner (eno, reg_no)   Write expressions

E-r diagram, Let us now make the E-R diagram for the student database as pe...

Let us now make the E-R diagram for the student database as per the explanation given in the previous section. We can also states the overall logical structure of a database usi

Discuss the problem of spurious tuples, Discuss the problem of Spurious tup...

Discuss the problem of Spurious tuples and how we may prevent it.    Ans:  A spurious tuple is, mainly, a record in a database that gets created while two tables are joined bad

Explain the fourth normal form, Fourth Normal Form (4NF) When attribut...

Fourth Normal Form (4NF) When attributes in a relation have multi-valued dependency, further Normalization to 4NF and 5NF are needed. Let us first find out what multi-valued d

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