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
LAWS / RULES - Dollo's Law                     :           Living organisms do exhibit evolutionary irreversibility or evolution is irreversible. Williston's Law

Components of an Object Type: An object type encapsulates the operations and data. Therefore, you can declare the methods and attributes in an object type specification, but no

BETWEEN and NOT BETWEEN Operator in SQL Example: Restricting exam marks to between 0 and 100 CREATE ASSERTION Marks_between_0_and_100 CHECK (NOT EXISTS (SELECT * FROM

IN OUT Mode An IN OUT parameter passes initial values to the subprogram being called and return efficient values to the caller. Within the subprogram, an IN OUT parameter acts

Parameter Default Values As the illustration below shows, you can initialize the IN parameters to the default values. In that way, you can pass various numbers of actual par

Overview of control structures According to the structure theorem, any computer program can be written by using the basic control structures as shown in figure below. They can b

V ariables and Constants in PL/SQL The PL/SQL permits you to declare constants and variables, and then use them in SQL and procedural statements anywhere in the expression. Th

Seeking a programmer to design a legal document with pre-existing fields that could allow the auto-population of client(s) information (i.e. Name, Account Number, Address etc.) int

Assignment Statement: The assignment statement sets the present value of the variable, parameter, field, or element. The statement consists of an assignment target followed by

%ROWCOUNT When its cursor or cursor variable is opened, the %ROWCOUNT is zeroed. Before the first fetch, the %ROWCOUNT yields 0. Afterward, it yields the number of rows fetche