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
QUESTION (a)(i) Define the term database. (ii) How is it different from a database management system? (b) What is the difference between an entity and an attribute? (c

Group By clauses  • It is used to group database tuples on the basis of definite common attribute value like as employees of a department. WHERE clause still can be used

Define value set? Value set: It is a set of values. You do not always need a user to enter junk free text within all the fields. Therefore, Oracle Apps uses value set to valida

Explain Stand Alone Query Language in details? Stand alone Query Language - The query language that can be used interactively is known as stand alone query language. It does no

What is persistency? Persistency ensures which data is stored and that after the object is no longer available (program stops running) the data will be available to other users

Explain the concept of a data model ? Data Model - Model is an abstraction procedure which hides irrelevant details although highlighting details relevant to the application

Question: The following relational database schema corresponds to a part of a database used by the Registry Department of a university. DEPARTMENT (d#, d-name, head-of-dept)

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

Express the following queries in SQL: (a) Write the SQL code that will create ALL the four tables given in the appendix. Your answer should not contain the primary key and

What are referential integrity constraints? A value that appears in single relation for a given set of attributes also appears for a particular set of attributes in another rel