arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.01627cs.DBcs.AI
收藏

规则在RDF三元存储模式上的适用性

Rule Applicability on RDF Triplestore Schemas

University of Southampton(南安普顿大学);Özyeğin University(奥兹耶金大学)

Paolo Pareti, George Konstantinidis, Timothy J. Norman, Murat Şensoy

摘要:

基于规则的系统在健康和安全方面发挥着至关重要的作用,专家制定的政策通常被正式化为规则。在处理日益庞大和动态的数据源时,例如物联网(IoT)应用程序,不仅要有效地应用规则,而且还要考虑它们对受特定模式限制的数据集的适用性。在本文中,我们定义了一个三重存储模式的概念,它模拟了一组RDF图。给定一组规则和这样的模式作为输入,我们提出了一种方法来确定规则的适用性和产生输出模式。输出模式对通过在输入模式的图模型上运行规则而获得的图进行建模。我们提出了两种方法:一种是基于计算一个规范(关键)的模式实例,和一种新的方法基于查询重写。我们提供的理论,复杂性和评估结果表明,我们的重写方法的优越效率。

英文摘要:

Rule-based systems play a critical role in health and safety, where policies created by experts are usually formalised as rules. When dealing with increasingly large and dynamic sources of data, as in the case of Internet of Things (IoT) applications, it becomes important not only to efficiently apply rules, but also to reason about their applicability on datasets confined by a certain schema. In this paper we define the notion of a triplestore schema which models a set of RDF graphs. Given a set of rules and such a schema as input we propose a method to determine rule applicability and produce output schemas. Output schemas model the graphs that would be obtained by running the rules on the graph models of the input schema. We present two approaches: one based on computing a canonical (critical) instance of the schema, and a novel approach based on query rewriting. We provide theoretical, complexity and evaluation results that show the superior efficiency of our rewriting approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑