%0 Journal Article
%T Query optimization for Deductive Databases<br>Query Optimization for Deductive Databases
%A Aoying Zhou
%A Baile Shi
%A <br>Zhou Aoying
%A Shi Baile
%J 计算机科学技术学报
%D 1995
%I 
%X A systematic, efficient compilation method for query evaluation of DeductiveDatabases (DeDB) is proposed in this paper. In order to eliminate redundancyand to minimize the potentially relevant facts, which are two key issues to theefficiency of a DeDB, the compilation process is decomposed into two phases.The first is the pre-compilation phase, which is responsible for the minimiza-tion of the potentially relevant facts. The second, which we refer to as thegeneral compilation phase, is responsible for the elimination of redundancy.The rule/goal graph devised by J. D. Ullman is appropriately extended andused as a uniform formalism. Two general algorithms corresponding to the twophases respectively are described intuitively and formally
%K Deductive database
%K query evaluation
%K query optimization<br>演绎数据库
%K 咨询优化
%K 知识集成
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=3B1D5E465A4CF3B3C4D3B08692E16B3F&yid=BBCD5003575B2B5F&vid=F3090AE9B60B7ED1&iid=0B39A22176CE99FB&sid=03A030BB0C519C60&eid=856C2E13D1000DB7&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=18