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
NULL Statement The NULL statement clearly specifies in action; it does nothing other than to pass control to the next statement. It can, though, improve the readability. In a

Using %TYPE The %TYPE attribute gives the datatype of a variable or the database column. In the example below, the %TYPE gives the datatype of a variable: credit REAL(7,2); debi

Using Cursor Attributes: Every cursor has 4 attributes: %NOTFOUND, %FOUND, %ISOPEN, and %ROWCOUNT. If appended to the cursor name, they return the helpful information about

What Are Subprograms? The Subprograms are named PL/SQL blocks which can take parameters and be invoked. The PL/SQL has 2 types of subprograms known as the procedure s and func

Rollback Behavior When a FORALL statement fails, the database changes are rolled back to an implicit savepoint marked before each of the SQL statement execution. The Changes t

SQLs counterpart of the key words: The text from the opening parenthesis to the end of the fourth line specifies the declared type of the table, meaning that every table ever

Perform the following queries on the Hospital1.DB using SQL Anywhere (START EARLY!). a. Which patients have purchased the drug "Tylenol"? List the names and addresses. Arrange the

Using the student and faculty tables create a select query that outputs all students for a specific advisor. Generate the execution plan, select out the explain plan . Create an

Variable Declaration - SQL SQL's support for variables is very similar to Tutorial D's, except that the syntax for creating persistent  variables-base tables-is quite differen

At times, customers make mistakes in submitting their orders and call to cancel the order. Brewbean’s wants to create a trigger that automatically updates the stock level of all pr