Rewriting Minimisations for Efficient Ontology-Based Query Answering
Rewriting Minimisations for Efficient Ontology-Based Query Answering
复制标题
重写最小化以实现高效的基于本体的查询应答
DOI：
10.1109/ictai.2016.0168
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
V. Vassalos
中科院分区：
文献类型：
--
作者：
Tassos Venetis;G. Stoilos;V. Vassalos
为输入查询和本体计算重写R的合取并集（Union of Conjunctive Rumber-UCQ）并在给定数据集上对其进行评估是本体上的查询应答的突出方法。然而，R在结构上可能很大且很复杂，因此需要采用其他技术，如查询包含和数据约束，以最小化Rew并导致有效的评估。尽管理论上合理，但如何在实践中高效、有效地实施其中许多技术可能具有挑战性。例如，许多系统不实现查询包含。在目前的文件中，我们提出了几个实用的技术UCQ重写最小化。首先，我们提出了一个优化的算法，用于消除冗余（w.r.t.包含）查询以及一个新的框架重写最小化使用数据约束。其次，我们展示了这些技术如何也可以用来加速R的计算。第三，我们将我们所有的技术集成在我们的查询重写系统IQAROS中，并使用许多人工和具有挑战性的现实世界的本体进行了广泛的实验评估，获得令人鼓舞的结果，因为在绝大多数情况下，我们的系统比两个最流行的最先进的系统更有效。
Computing a (Union of Conjunctive Queries - UCQ) rewriting R for an input query and ontology and evaluating it over the given dataset is a prominent approach to query answering over ontologies. However, R can be large and complex in structure hence additional techniques, like query subsumption and data constraints, need to be employed in order to minimise Rew and lead to an efficient evaluation. Although sound in theory, how to efficiently and effectively implement many of these techniques in practice could be challenging. For example, many systems do not implement query subsumption. In the current paper we present several practical techniques for UCQ rewriting minimisation. First, we present an optimised algorithm for eliminating redundant (w.r.t. subsumption) queries as well as a novel framework for rewriting minimisation using data constraints. Second, we show how these techniques can also be used to speed up the computation of R in the first place. Third, we integrated all our techniques in our query rewriting system IQAROS and conducted an extensive experimental evaluation using many artificial as well as challenging real-world ontologies obtaining encouraging results as, in the vast majority of cases, our system is more efficient compared to the two most popular state-of-the-art systems.