自自底向上的的数据评估:初步报告
Bottom-Up Evaluation of Datalog: Preliminary Report
摘要:
自自底向上的【形】评价研究已久,是教科书中的标准材料。然而,如果你真的想开发一个演绎数据库系统,事实证明有很多实现选项。例如,没有给出应用规则实例的顺序。在本文中,我们研究了一种方法,立即使用派生元组派生更多的元组(称为推方法)。以这种方式,可以减少用于中间结果的存储空间。我们的方法的主要贡献是我们在运行时最小化复制值的方式,并在编译时已经做了很多工作。
英文摘要:
Bottom-up evaluation of Datalog has been studied for a long time, and is standard material in textbooks. However, if one actually wants to develop a deductive database system, it turns out that there are many implementation options. For instance, the sequence in which rule instances are applied is not given. In this paper, we study a method that immediately uses a derived tuple to derive more tuples (called the Push method). In this way, storage space for intermediate results can be reduced. The main contribution of our method is the way in which we minimize the copying of values at runtime, and do much work already at compile-time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。