arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.01190cs.DB
收藏

FedQPL:一种基于RDF数据源异构联邦的逻辑查询规划语言(扩展版)

FedQPL: A Language for Logical Query Plans over Heterogeneous Federations of RDF Data Sources (Extended Version)

Sijin Cheng, Olaf Hartig

摘要:

RDF数据源的联合在查询无法单独从一个数据源获得的答案和见解时提供了巨大的潜力。规划在这样的联合上执行查询的挑战在于,联合在由联合成员提供的数据访问接口的类型方面可能是异构的。这一挑战在文献中没有得到太多关注。本文提供了一个坚实的正式基础,为未来的方法,旨在解决这一挑战。我们的主要概念的贡献是一个形式语言表示查询执行计划,此外,我们确定了这个语言的片段,可以用来捕捉一个给定的查询的不同部分选择相关的数据源的结果。作为技术贡献,我们表明,这个片段是更有表现力的比现有的源选择方法,这有效地突出了这些方法的固有局限性所支持的。此外,我们表明,源选择问题是NP-难的,在$Σ_2^\mathrm{P}$,我们提供了一套全面的重写规则,可用作查询优化的基础。

英文摘要:

Federations of RDF data sources provide great potential when queried for answers and insights that cannot be obtained from one data source alone. A challenge for planning the execution of queries over such a federation is that the federation may be heterogeneous in terms of the types of data access interfaces provided by the federation members. This challenge has not received much attention in the literature. This paper provides a solid formal foundation for future approaches that aim to address this challenge. Our main conceptual contribution is a formal language for representing query execution plans; additionally, we identify a fragment of this language that can be used to capture the result of selecting relevant data sources for different parts of a given query. As technical contributions, we show that this fragment is more expressive than what is supported by existing source selection approaches, which effectively highlights an inherent limitation of these approaches. Moreover, we show that the source selection problem is NP-hard and in $Σ_2^\mathrm{P}$, and we provide a comprehensive set of rewriting rules that can be used as a basis for query optimization.

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

↑