Technical Reports

The ICICS/CS Reading Room


UBC CS TR-83-11 Summary

A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values, June 1983 Raymond Reiter

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.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.