RDF查询处理中的子图同构驯服
Taming Subgraph Isomorphism for RDF Query Processing
摘要:
RDF数据被用于对生命科学、语义网、生物信息学和社会图等各个领域的知识进行建模。实际RDF数据的大小达到数十亿个三倍。这就需要一个有效处理RDF数据的框架。RDF数据处理的核心功能是子图模式匹配。支持高效子图模式匹配有两个完全不同的方向。一个方向是开发专门的RDF查询处理引擎,利用RDF数据的属性在过去的十年中,而另一个方向是开发有效的子图同构算法一般,标记图超过30年。虽然两个方向都有类似的目标(即,在给定查询图的数据图中寻找子图),它们已经被独立研究,没有明确的原因。我们认为,一个子图同构算法可以很容易地修改,以处理图同态,这是RDF模式匹配语义,只需删除注入约束。在本文中,最先进的子图同构算法的基础上,我们提出了一个内存中的解决方案,TurboHOM++,这是驯服的RDF处理,我们比较了它与代表RDF处理引擎的几个RDF基准在服务器机器,其中数十亿的三元组可以加载在内存中。为了加速TurboHOM++,我们还提供了一个简单而有效的转换和一系列优化技术。使用几个RDF基准测试的大量实验表明,TurboHOM++始终显着优于代表性的RDF引擎。具体来说,TurboHOM++的性能比竞争对手高出五个数量级。
英文摘要:
RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching. There have been two completely different directions for supporting efficient subgraph pattern matching. One direction is to develop specialized RDF query processing engines exploiting the properties of RDF data for the last decade, while the other direction is to develop efficient subgraph isomorphism algorithms for general, labeled graphs for over 30 years. Although both directions have a similar goal (i.e., finding subgraphs in data graphs for a given query graph), they have been independently researched without clear reason. We argue that a subgraph isomorphism algorithm can be easily modified to handle the graph homomorphism, which is the RDF pattern matching semantics, by just removing the injectivity constraint. In this paper, based on the state-of-the-art subgraph isomorphism algorithm, we propose an in-memory solution, TurboHOM++, which is tamed for the RDF processing, and we compare it with the representative RDF processing engines for several RDF benchmarks in a server machine where billions of triples can be loaded in memory. In order to speed up TurboHOM++, we also provide a simple yet effective transformation and a series of optimization techniques. Extensive experiments using several RDF benchmarks show that TurboHOM++ consistently and significantly outperforms the representative RDF engines. Specifically, TurboHOM++ outperforms its competitors by up to five orders of magnitude.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。