论文标题
DatalogMTL中的半层次物质化
Seminaive Materialisation in DatalogMTL
论文作者
论文摘要
DatalogMTL是数据元的扩展，该数据对公制的临时运算符，在基于时间本体的数据访问和查询答案以及流推理中找到了应用程序。 DatalogMTL的实用算法依赖于基于物质化的推理，在这些推理中，在连续的规则应用程序中以前向链接方式得出时间事实。但是，基于现代化的程序是基于幼稚的评估策略，其中效率低下的主要来源源于冗余计算。 在本文中，我们提出了一个基于物质化的过程，该程序类似于数据元中的经典半算法，旨在通过确保在执行算法期间最多一次考虑每一个时间规则实例，以最大程度地减少冗余计算。我们的实验表明，我们针对DatalOgMTL的优化半策略能够显着减少实质化时间。
DatalogMTL is an extension of Datalog with metric temporal operators that has found applications in temporal ontology-based data access and query answering, as well as in stream reasoning. Practical algorithms for DatalogMTL are reliant on materialisation-based reasoning, where temporal facts are derived in a forward chaining manner in successive rounds of rule applications. Current materialisation-based procedures are, however, based on a naive evaluation strategy, where the main source of inefficiency stems from redundant computations. In this paper, we propose a materialisation-based procedure which, analogously to the classical seminaive algorithm in Datalog, aims at minimising redundant computation by ensuring that each temporal rule instance is considered at most once during the execution of the algorithm. Our experiments show that our optimised seminaive strategy for DatalogMTL is able to significantly reduce materialisation times.
