0


4Store中最小RDFS反向推理的设计与实现

The Design and Implementation of Minimal RDFS Backward Reasoning in 4store
课程网址: http://videolectures.net/eswc2011_salvadores_reasoning/  
主讲教师: Manuel Salvadores
开课单位: 南安普顿大学
开课时间: 2011-07-07
课程语种: 英语
中文简介:
本文描述了基于反向链接方法并在集群RDF三元组上实现的最小RDFS语义的设计和实现。所提出的系统称为4sr，它使用4store作为基础架构。为了实现高度可扩展的系统，我们在四元存储的最低级别（绑定操作）中实现了推理。绑定操作在所有数据切片中并发运行，允许在群集之间并行处理推理。在本文中，我们提供了有关体系结构，推理算法以及使用LUBM基准测试的可扩展性评估的详细说明。 4sr是GNU GPL3许可下可用的稳定工具，可由社区免费使用和扩展。
课程简介: This paper describes the design and implementation of Minimal RDFS semantics based on a backward chaining approach and implemented on a clustered RDF triplestore. The system presented, called 4sr, uses 4store as base infrastructure. In order to achieve a highly scalable system we implemented the reasoning at the lowest level of the quad store, the bind operation. The bind operation runs concurrently in all the data slices allowing the reasoning to be processed in parallel among the cluster. Throughout this paper we provide detailed descriptions of the architecture, reasoning algorithms, and a scalability evaluation with the LUBM benchmark. 4sr is a stable tool available under a GNU GPL3 license and can be freely used and extended by the community.
关 键 词: 反向链接; 高度可扩展; 四元存储
课程来源: 视频讲座网
最后编审: 2019-04-13：cwx
阅读次数: 61

纠错/补充/评论/留言
评论/留言 纠错/补充
验证算术题： 6 + 1 =