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
Cursor Variables:   To execute the multi-row query, the Oracle opens an unnamed work region that stores the processing information. You can use an explicit cursor that names

THEORY OF BIOGENESIS - This theory explains that the existing living organisms originated from pre-existing living beings not from non living entities. This concept of or

ALTER TABLE bb_basketitem ADD CONSTRAINT bitems_qty_ck CHECK (quantity BEGIN INSERT INTO bb_basketitem VALUES (88,8,10.8,21,16,2,3); END; Brewbean’s wants to add a check

Manipulating Local Collections Within PL/SQL, to manipulate the local collection, by using the  TABLE and CAST operators . The operands of CAST are a collection declared locally

Tautology - Equivalences Rules: If there Tautologies are not all the time as much easy to note as the one above so than we can use these truth tables to be definite that a sta

Positional and Named Notation You can write the actual parameters when calling a subprogram, using either positional or named notation. That is, you can point to the relationsh

Count Operator in SQL Example: Counting the students who have scored more than 50 in some exam (SELECT COUNT (*) FROM (SELECT DISTINCT StudentId FROM EXAM_MARK WHE

What Is a Collection The collection is an ordered group of elements, all of similar type (for e.g. the grades for a class of students). Each element has a unique subscript whic

Advantages of Invoker Rights The Invoker-rights routines centralize the data retrieval. They are particularly helpful in applications which store data in various schemas. In su

Pass the nulls to a dynamic SQL: Passing Nulls: Assume that you want to pass the nulls to a dynamic SQL statement. For illustration, you may write the EXECUTE IMMEDIATE