演绎数据库中处理递归查询的一种改进算法  

An Optimization Algorithm of Magic Set Dealing with Recursive Query in Deductive Database

作　　者：霍纬纲[1] 陶世群[1] 

机构地区：[1]山西大学计算机科学系,山西太原030006

出　　处：《山西大学学报（自然科学版）》2004年第2期139-142,共4页Journal of Shanxi University(Natural Science Edition)

摘　　要：如何提高演绎数据库的递归查询效率是演绎数据库领域所面临的一个重要问题 .介绍了一种结合传统的逻辑查询处理自顶向下和自底向上两种处理方式的递归查询算法 .该算法基于侧向信息传递策略 ,把查询计算始终限制在与查询的初始约束相关的元组 。How to improve the efficiency of evaluation recursive query is an important matter of research in deductive database.An optimal method for handling recursive query was introduced,which combine the merits of bottom-up and top-down.The algorithm is based on idea of sideways information-passing strategy and improve efficiency by restricting the computation to tuples that are related to the query.Therefor,it avoids a large amount of redundant evaluation.

关 键 词：演绎数据库 递归查询 自顶向下 自底向上 魔集算法 侧向信息传递策略 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]