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

RDF的形式化图模型及其实现

A Formal Graph Model for RDF and Its Implementation

Vinh Nguyen, Jyoti Leeka, Olivier Bodenreider, Amit Sheth

摘要:

将RDF抽象图模型形式化,使其与RDF形式语义兼容,一直是语义Web的基础问题之一。在本文中,我们提出了一个新的RDF数据集的形式化图模型。该模型允许我们以图的形式表达当前的模型理论语义。我们还提出了资源路径和三重路径的概念以及遍历新图的算法。我们通过两个实现来证明这种图模型的可行性:一个是一个新的图引擎GraphKE,另一个是从RDF-3X扩展而来的,以表明现有的系统也可以从这种模型中受益。为了评估我们的图模型的经验方面,我们选择了最短路径算法,并在GraphKE和RDF-3X中实现它。我们在两个引擎上进行的在YAGO 2S-SP数据集中寻找最短路径的实验在执行时间方面表现不错。实验结果表明,我们的图模型与定义良好的语义可以有效地实现。

英文摘要:

Formalizing an RDF abstract graph model to be compatible with the RDF formal semantics has remained one of the foundational problems in the Semantic Web. In this paper, we propose a new formal graph model for RDF datasets. This model allows us to express the current model-theoretic semantics in the form of a graph. We also propose the concepts of resource path and triple path as well as an algorithm for traversing the new graph. We demonstrate the feasibility of this graph model through two implementations: one is a new graph engine called GraphKE, and the other is extended from RDF-3X to show that existing systems can also benefit from this model. In order to evaluate the empirical aspect of our graph model, we choose the shortest path algorithm and implement it in the GraphKE and the RDF-3X. Our experiments on both engines for finding the shortest paths in the YAGO2S-SP dataset give decent performance in terms of execution time. The empirical results show that our graph model with well-defined semantics can be effectively implemented.

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

↑