A sound and sometimes complete query evaluation algorithm for relational databases with null values
- 1 April 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (2), 349-370
- https://doi.org/10.1145/5383.5388
Abstract
A sound and, in certain cases, complete method is described for evaluating queries in relational databases with null values where these nulls represent existing but unknown individuals. The soundness and completeness results are proved relative to a formalization of such databases as suitable theories of first-order logic. Because the algorithm conforms to the relational algebra, it may easily be incorporated into existing relational systems.Keywords
This publication has 6 references indexed in Scilit:
- Towards a Logical Reconstruction of Relational Database TheoryPublished by Springer Nature ,1984
- A Formal Approach to Null Values in Database RelationsPublished by Springer Nature ,1981
- Equality and Domain Closure in First-Order DatabasesJournal of the ACM, 1980
- Extending the database relational model to capture more meaningACM Transactions on Database Systems, 1979
- Null values in data base management a denotational semantics approachPublished by Association for Computing Machinery (ACM) ,1979
- On Closed World Data BasesPublished by Springer Nature ,1978