At least Arity+ 1 examples are required to clearly show the uniqueness constraints. 要清楚地显示唯一性约束,至少需要实参数量+1个示例。
The algorithm follows the magic-set paradigm of a rewriting phase followed by semi-naive bottom-up evaluation, and achieves its efficiency by reducing the arity of the recursive predicates in the transformed rules. 和右线性递归计算算法一样,本文提供的算法遵循魔集的模式:首先改写规则,然后用半扑质的自底向上算法计算新规则.算法的有效性通过减少递归谓词的元数实现。
Therefore, trying to reduce the arity of IDB* predicates is significative to improving the efficiency of query. 因此,设法减少IDB谓词项数,对提高查询效率是十分有意义的。
However, in search of the relevant data, the cost of generating additional tuples produced by logic program to which magic transformation is applied increases with the arity of IDB ( Intensional DataBase) predicates increasing. 但是随着递归IDB(IntensionalDatabase)谓词的项的个数增大,经魔集转换的逻辑程序为寻找与查询相关数据而产生附加元组的开销也会增大。