A sound and sometimes complete query evaluation algorithm for relational databases with null values

A sound and sometimes complete query evaluation algorithm for relational databases with null values
复制标题

针对具有空值的关系数据库的健全且有时完整的查询评估算法

DOI:
10.1145/5383.5388
复制
发表时间:
1986
期刊:
J. ACM
影响因子:
--
通讯作者:
R. Reiter
R. Reiter
中科院分区:
--
文献类型:
--
作者:
R. Reiter

文献摘要

被引文献

相似文献

描述了一种健全且在某些情况下完整的方法,用于评估具有空值的关系数据库中的查询,其中这些空值代表现有但未知的个体。相对于作为合适的一阶逻辑理论的数据库的形式化,证明了结果的健全性和完整性。由于该算法符合关系代数,因此可以很容易地合并到现有的关系系统中。
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.