广义查询的计数算法  

A COUNTING ALGORITHM FOR GENERALIZED QUERIES

作　　者：范明[1] 李连友[1] 

机构地区：[1]郑州大学计算机科学系

出　　处：《软件学报》1994年第10期44-49,共6页Journal of Software

基　　金：河南省自然科学基金;河南省教委自然科学基金

摘　　要：计数算法是最著名的ＳＬ递归处理算法之一．对于一类称作计数线性的递归，它具有良好的性能．然而，计数算法要求查询的约束集为单值的，因此很难用作子目标的处理策略．本文提供一种新的广义查询计数算法，它能处理任意的多值约束集．从而本文提供的算法不仅能够用于查询的求值，而且也能用于子目标的处理．算法的正确性和变换后的规则的有效性也在本文简略讨论．The Counting algorithm is one of the best -known qurey-processing algorithms for SL recursions. It performs well for a kind of recursions which are counting linear. However, since it requires that the binding set of the given query bea singleton, it is very difficult to use it as a subgoal processing strategy. In this paper, a new counting algorithm for generalized queries is presented. The algorithm presented here can handle any multi-value binding sets, so it can be used not only for query evaluating, but also for subgoal processing. The correctness of the algorithm and the efficiency of the transformed rules are also discussed briefly in this paper.

关 键 词：递归查询 广义查询 计数算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]