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
Parameter Aliasing   To optimize the subprogram call, the PL/SQL compiler can decide between the two techniques of the parameter passing. With the by-value techniques, the v

Declaring and Initializing Objects: An object type is once defined and installed in the schema; you can use it to declare the objects in any PL/SQL, subprogram, block or packa

Deleting Objects You can use the DELETE statement to eradicate objects from an object table. To eradicate objects selectively, you use the WHERE clause, as shown below: BEG

What are 3 good practices of modeling and/or implementing data warehouses?

Parameter and Keyword Description: collection_name: This keyword identifies the index-by table, nested table, or varray formerly declared within the present scope. cu

Boolean Values Only the values TRUE, FALSE, & NULL can be assigned to a Boolean variable. For illustration, given the declaration DECLARE done BOOLEAN; the following statements

Example of Tables within a Table - SQL Example: Obtaining C_ER from COURSE and EXAM_MARK SELECT CourseId, CAST (TABLE (SELECT DISTINCT StudentId, Mark FROM EXAM_MARK AS EM

UNNEST operator in SQL The inverse operator of GROUP is UNGROUP. SQL has an operator, UNNEST, that can be used for similar purposes, but its method of invocation is somewhat p

Ensuring Backward Compatibility   The PL/SQL Version 2 permits some abnormal behavior which Version 8 disallows. Particularly, Version 2 permits you to (i) Make the forw

Disjunction (OR, ∨) Again we have nine rows instead of just four and again, when unknown is not involved, the rows are as for 2VL. Also, when anything is paired with true, t