摘要
1988年Klug给出了第一个稠密域上的不等式合取查询包含问题的算法,但该方法不适用于非稠密域.本文解决非稠密域上的不等式合取查询的包含问题.
Klug gave the first algorithm for containment problems of conjunctive queries containing inequalities on dense data domains in 1988. But this algorithm does not work on nondense data domains. This paper gives an algorithm for containment problems of conjunctive queries containing inequalities on nondense data domains.
出处
《计算机学报》
EI
CSCD
北大核心
1992年第12期898-905,共8页
Chinese Journal of Computers
关键词
关系型数据库
合取查询
非稠密域
Relational database, conjunctive query, nondense domain, containment problem.
