Table represents an extension - sql, PL-SQL Programming

Table Represents an Extension - SQL

It describes how each tuple in a relation represents a true instantiation of some predicate and each true instantiation is represented by some tuple in that relation. Thus, a relation represents an extension, its body containing exactly one tuple corresponding to each element of the extension. It is true that some SQL tables can be interpreted in this way but it is also true that some SQL tables cannot. In fact there are at least two distinct ways in which an SQL table cannot be thus interpreted:

a) In SQL it is possible for the same row to appear more than once in a table. Moreover, if tables t1 and t2 differ only in the number of appearances of some row, then that difference is significant-they are not the same table.

b) Although I have noted that in SQL the instantiation 5 < NULL cannot be considered to appear in either the extension of a < b or NOT (a < b), the row (5, NULL) can appear in a table. What could be the corresponding predicate? It would have to be some dyadic predicate, P (a, b) say, such that P (5, NULL) is true. But if NULL stands for "some value but we don't know which", how could that row appear in the same table as, say, (6, 12)? If (6, 12) means "6 is related to 12" then (5, NULL), in relational theory, would have to mean that 5 is related to NULL in that same way. But it can't, because NULL doesn't designate anything. If instead it means "5 is related to something whose identity is unknown", then we have a sentence in which nothing appears in substitution for the parameter b.

Posted Date: 1/18/2013 3:09:33 AM | Location : United States







Related Discussions:- Table represents an extension - sql, Assignment Help, Ask Question on Table represents an extension - sql, Get Answer, Expert's Help, Table represents an extension - sql Discussions

Write discussion on Table represents an extension - sql
Your posts are moderated
Related Questions
Example of Check Constraints Example: Workaround for when subqueries not permitted in CHECK constraints CREATE FUNCTION NO_MORE_THAN_20000_ENROLMENTS ( ) RETURNS BOOLEAN

Extension and AND in SQL The theory book gives the following simple example of relational extension in Tutorial D: EXTEND IS_CALLED ADD ( FirstLetter ( Name ) AS Initial )

Updating Variables For assignment, SQL uses the key word SET, as in SET X = X + 1 (read as "set X equal to X+1") rather than X: = X + 1 as found in many computer languages.

%FOUND Subsequent to a cursor or cursor variable is opened but before the first fetch, the %FOUND yields NULL. Afterward, it yields TRUE when the last fetch returned a row, or

Passing Cursor Parameters You use the OPEN statement to pass the parameters to a cursor. Unless you want to accept the default values, each proper parameter in the cursor decl

Committing and Rolling Back The COMMIT and ROLLBACK end the active autonomous transaction but do not exit the autonomous routine. As the figure shows, if one transaction ends,

Query: SELECT * FROM EMPLOYEE1; Select 5 columns and all rows from one table Query: SELECT C_ID, COMPANY, BUILDING, DEPARTMENT, BRANCH FROM CONTRACT;

Project Description: We organize an online system called ACPAS we have created a project called EVO that can be use by our customers to integrate their web sites with the Acpas

Operators on Tables and Rows Row Extraction TUPLE FROM r, SQL has row subqueries. These are just like scalar subqueries except that they may specify more than one column.

Using RENAME in combination with JOIN - SQL Example gives pairs of ids of students having the same name, by joining two renamings of IS_CALLED. Example gives an equivalent ex