A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values

Authors:
Raymond Reiter
Affiliations:
-
Venue:
A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values
Year:
1983

Citing 0
Cited 4

On the integrity of databases with incomplete information

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
On the representation and querying of sets of possible worlds

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Logic and Databases: A Deductive Approach

ACM Computing Surveys (CSUR)
On relational algebra with marked nulls preliminary version

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a sound and, in certain cases, complete method 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.