SPARQL query rewriting for implementing data integration over linked data

SPARQL query rewriting for implementing data integration over linked data
复制标题

DOI:
10.1145/1754239.1754244
复制
发表时间:
2010-03
期刊:
--
影响因子:
--
通讯作者:
Gianluca Correndo;M. Salvadores;Ian Millard;H. Glaser;N. Shadbolt
Gianluca Correndo;M. Salvadores;Ian Millard;H. Glaser;N. Shadbolt
中科院分区:
其他
文献类型:
--
作者:
Gianluca Correndo;M. Salvadores;Ian Millard;H. Glaser;N. Shadbolt

文献摘要

被引文献

相似文献

由于关联数据社区的活跃,最近以RDF发布结构化数据的活动有所增加。从学术到地理再到基因相关的信息,在Web上存在着如此庞大的信息云,当涉及到调和数据发布者采用的异构模式时,这提出了巨大的挑战。几年来,语义Web社区一直在开发用于对齐数据模型(本体)的算法。然而,利用这种本体对齐来实现数据集成仍然是一个缺乏支持的研究课题。本体对齐的语义(通常在逻辑框架上定义)意味着对大量数据的推理步骤,这通常很难实现,而且很少在Web维度上扩展。提出了一种基于SPARQL查询重写实现RDF数据中介的算法。该方法基于RDF模式重写规则的编码,这些规则构成了SPARQL查询结构的一部分。
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community. The presence on the Web of such a huge information cloud, ranging from academic to geographic to gene related information, poses a great challenge when it comes to reconcile heterogeneous schemas adopted by data publishers. For several years, the Semantic Web community has been developing algorithms for aligning data models (ontologies). Nevertheless, exploiting such ontology alignments for achieving data integration is still an under supported research topic. The semantics of ontology alignments, often defined over a logical frameworks, implies a reasoning step over huge amounts of data, that is often hard to implement and rarely scales on Web dimensions. This paper presents an algorithm for achieving RDF data mediation based on SPARQL query rewriting. The approach is based on the encoding of rewriting rules for RDF patterns that constitute part of the structure of a SPARQL query.