Basic set operation, Database Management System

These are the binary operations; i.e., each is applied to two relations or sets. These two relations can be union compatible excluding in case of Cartesian product. Two relations R (A1, A2,....., An) and S (B1, B2,......,Bn) are said to be union compatible if they have the similar degree n and domains of the corresponding attributes are also the similar

i.e. Domain (Ai) = Domain (Bi) for 1<=i<=n.

Posted Date: 3/6/2013 5:41:24 AM | Location : United States







Related Discussions:- Basic set operation, Assignment Help, Ask Question on Basic set operation, Get Answer, Expert's Help, Basic set operation Discussions

Write discussion on Basic set operation
Your posts are moderated
Related Questions
client server architeutre

What are three components of the schema architecture proposed by ANSI/SPARC? The three component schema architecture proposed by ANSI/SPARC is as given below: External sche

what is entity in database system?

What is an Index? An index is a small table having only two columns. The first column has a copy of the primary or candidate key of a table and the second column having a set o

Ask q“A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded wher

What do you understand by transitive dependencies? Define with an example any two problems that can take place in the database if transitive dependencies are available in the datab

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

Explain in detail the consistency model of the distributed file system you studied (GFS or AFS). Present the consistency model chosen and how it was achieved through design. Clarit

What are the benefits of document scanning? Document scanning, in addition to being cost-efficient, also enhances productivity. This service enhances security as you set the pa

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty