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
PL SQL Code Review HEADER ELEMENTS File Name Clear, meaningful and descriptive about main objective of the file. Multiple words are joined using underscores which adh

In Packages The Forward declarations also group logically related subprograms in the package. The subprogram specifications go in the package specification, & the subprogram b

I want to implement heap sort algorithm in pl sql please share the source code for guidance

Special cases of projection This section describes the identity projection, r {ALL BUT}, and the projection on no attributes, r { }, which yields TABLE_DUM when r is empty, ot

Second Step at defining type SID in SQL CREATE TYPE SID AS VARCHAR(5) ; Explanation: TYPE SID announces that a type named SID is being defined to the system.

COMMIT Statement The COMMIT statement explicitly makes everlasting changes to the database during the present transaction. The Changes made to the database are not considered e

Implicit Cursor Attributes The Implicit cursor attributes returns the information about the execution of an INSERT, DELETE, UPDATE, or SELECT INTO statement. The cursor attribu

Fetching Across Commits The FOR UPDATE clauses acquire exclusive all row locks. All rows are locked when you open the cursor, and when you commit your transaction they are unl

I need SQL to infopath data connection Project Description: Want data retrieval connection from SQL to SharePoint infopath Skills required are Sharepoint, SQL

Benefit of the dynamic SQL: This part shows you how to take full benefit of the dynamic SQL and how to keep away from some of the common pitfalls. Passing the Names of Sc