0


SPARQL基准场景中RDF数据管理方法的实验比较

An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario
课程网址: http://videolectures.net/iswc08_schmidt_ecrdf/  
主讲教师: Michael Schmidt
开课单位: 弗莱堡大学
开课时间: 2008-11-24
课程语种: 英语
中文简介:
高效的RDF数据管理是实现语义Web愿景的基石之一。过去,已经提出了不同的RDF存储策略,从简单的三重存储到更高级的技术,如聚类或谓词上的垂直分区。我们在SP2Bench SPARQL性能基准测试套件之上对现有存储策略进行了实验性比较,并通过将结果与基准测试场景的纯关系模型进行比较,将结果置于上下文中。我们观察到(1)在性能和可伸缩性方面,构建在列存储DBMS之上的简单三元组存储在选择物理(谓词,主语,对象)排序顺序时与垂直分区方法相比具有竞争力,(2)in我们使用真实世界查询的场景,没有一种方法可以扩展到包含数千万个RDF三元组的文档,以及(3)这些方法都不能与纯粹的关系模型竞争。我们得出结论,未来的研究对于进一步推进RDF数据管理是必要的。
课程简介: Efficient RDF data management is one of the cornerstones in realizing the Semantic Web vision. In the past, different RDF storage strategies have been proposed, ranging from simple triple stores to more advanced techniques like clustering or vertical partitioning on the predicates. We present an experimental comparison of existing storage strategies on top of the SP2Bench SPARQL performance benchmark suite and put the results into context by comparing them to a purely relational model of the benchmark scenario. We observe that (1) in terms of performance and scalability, a simple triple store built on top of a column-store DBMS is competitive to the vertically partitioned approach when choosing a physical (predicate, subject, object) sort order, (2) in our scenario with real-world queries, none of the approaches scales to documents containing tens of millions of RDF triples, and (3) none of the approaches can compete with a purely relational model. We conclude that future research is necessary to further bring forward RDF data management.
关 键 词: 数据管理; 语义Web; RDF
课程来源: 视频讲座网
最后编审: 2019-05-05:lxf
阅读次数: 43