Relational algebra - sql, PL-SQL Programming

Relational Algebra - SQL

It describes some operators, that together constitute an algebra that is not only relationally complete but also irreducibly so (very nearly- apart from RENAME, which can be expressed in terms of extension and projection, none of those operators can be discarded without sacrificing completeness). We can use these operators as a basis for testing SQL for relational completeness. If we can show that for every invocation of one of these operators there is an equivalent SQL expression, then we will have shown that SQL is relationally complete. By "equivalent" we mean an expression whose table operands are counterparts of the relation operands (ignoring the ordering that SQL imposes on the columns) and whose result is a table counterpart result, where a table is a counterpart of a relation if and only if it satisfies all of the following conditions:

  • Every column has a name
  • No two distinct columns have the same name
  • No row appears more than once
  • Null doesn't appear in place of a value anywhere in the table
  • Every row consists entirely of its column values and doesn't somehow contain any additional data
Posted Date: 1/18/2013 4:26:49 AM | Location : United States







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

Write discussion on Relational algebra - sql
Your posts are moderated
Related Questions
#quesWrite a cursor to open an employee database and fetch the employee record whose age is greater than 45.tion..

Problem: (a) Define the following terms: (i) data mining. (ii) OLAP. (b) Differentiate between snowflake schema and star schema. Support your answer with appropriate

Brewbean's is implementing a new discount for return shoppers - every fifth completed order receives a 10% discount. The count of orders for a shopper is placed in a packaged varia

Comparison Operators The Comparison operators can compare one expression to another. The outcome is always true, false, or null. Usually, you use a comparison operators in condi

WHILE-LOOP The WHILE-LOOP statement relates a condition with the series of statements enclosed by the keywords LOOP and END LOOP, as shown: WHILE condition LOOP sequence_of_sta

Control Structures The Control structures are the most important PL/SQL extension to the SQL. Not only does PL/SQL let you manipulate Oracle data, it lets you process the data

Using DEFAULT You can use the keyword DEFAULT rather than that of the assignment operator to initialize the variables. For e.g. the declaration blood_type CHAR := ’O’; it can b

How do I display usernames for students from a student table, assigning each student a username initials001 (initials is the actual student initials), and if the students initials

Declaring Exceptions The Exceptions can be declared only in the declarative part of the PL/SQL subprogram, block, or package. By introducing its name, you can declare an excep

Data Types in SQL - Timestamp TIMESTAMP for values representing points in time on a specified uniform scale. DATE is used for timestamps on a scale of one day, such as DATE '2