Relational algebra, Database Management System

 Relational Algebra is a set of basic operations used to influence the data in relational model. These operations allow the user to specify basic retrieval request. The result of retrieval is a new relation, produced from one or more relations. These operations can be divided  in two categories:

•  Basic Set Operations

1)  UNION

2)  SET DIFFERENCE

3)  INTERSECTION

4)  CARTESIAN PRODUCT

•  Relational Operations

1)   JOIN

2)  PROJECT

3) SELECT

4)  DIVISION

Posted Date: 3/6/2013 5:40:47 AM | Location : United States







Related Discussions:- Relational algebra, Assignment Help, Ask Question on Relational algebra, Get Answer, Expert's Help, Relational algebra Discussions

Write discussion on Relational algebra
Your posts are moderated
Related Questions
Why Like predicate used for? LIKE predicate: The LIKE predicate searches for strings in which have a certain pattern.

Explain the rules for creating a labelled precedence graph for testing view serializability.            Ans: A schedule S is view serializable if it is view equivalent to a ser

Write A short note on temporary tables? Temporary Tables - Temporary tables exists solely for a particular session, or whose data persists for the duration of the transaction

#Use the following database schema: 1) Patient—PatientID, Name, DOB 2) Doctor—DoctorID, Name, MedLicenseNumber, Phone 3) Medication—MedicationID, BrandName, GenericName 4) Prescrip

Let us now talk about the relational operations: SELECT The select operation is used to select few specific record from the database based on different criteria, This is a un

What are the purpose for having variable length records? What kinds of separator characters are required for each? Variable-Length Records - Variable-length records are thos

WHY SHOULD NULL IN A RELATION BE AVOID AS possible?

State the data flow diagram of functional model Any action initiated by transition in the state diagram can be extended into an entire data flow diagram in functional model. Th

Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen

Discuss the types of integrity constraints in which must be checked for the update operations - Insert and Delete. Give examples. Insert operation can violet any of the subse