Nonapplicable nulls (Q1822518): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(86)90022-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213061376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence of Database Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of the universal relation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the elimination of common subexpressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database relations with null values / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relational model of data and cylindric algebras / rank
 
Normal rank

Latest revision as of 19:51, 17 June 2024

scientific article
Language Label Description Also known as
English
Nonapplicable nulls
scientific article

    Statements

    Nonapplicable nulls (English)
    0 references
    0 references
    0 references
    1986
    0 references
    A nonapplicable null appears in a relation whenever the value of the corresponding attribute does not exist. In order to evaluate a query on a relation r involving such null values, the information contained in r is represented by a set of null-free instances, then the query on r - expressed in a user-friendly query language (Generalized Relational Calculus) - is translated into a set of queries on the null-free instances. Conversely, we define the operations on relations with nulls (Generalized Relational Algebra) and we proved an extension of Codd's completeness theorem.
    0 references
    0 references
    relational database
    0 references
    nonapplicable null
    0 references
    Generalized Relational Calculus
    0 references
    Generalized Relational Algebra
    0 references
    0 references