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

RDF图中频繁星模式的紧化

Compacting Frequent Star Patterns in RDF Graphs

Farah Karim, Maria-Esther Vidal, Sören Auer

摘要:

知识图谱已经成为用于使用图数据模型来表示实体及其属性的流行形式体系,资源描述框架(RDF)。RDF图包括使用标注有属性的标记边连接到对象或其他实体的相同类型的实体。RDF图通常包含在特定属性组中共享相同对象的实体,即,它们与由这些性质和物体组成的星图相匹配。如果这些星型模式中的这些实体或属性的数量很大,RDF图的大小和查询处理就会受到负面影响;我们将这些星型模式称为频繁星型模式。我们解决的问题,确定频繁的星型模式在RDF图和设计的概念,因式分解的RDF图,这表示紧凑的RDF图的频繁星型模式的数量最小化的表示。我们还开发了计算方法来识别频繁的星形模式,并生成一个分解的RDF图,紧凑的RDF分子取代频繁的星形模式。频繁星型模式的紧凑RDF分子表示实例化相应星型模式的RDF子图。代替使所有实体匹配原始频繁星型模式,添加代理实体并使其与频繁星型模式的属性相关;它链接到最初匹配频繁星型模式的实体。我们评估了我们的因子分解技术的性能在几个RDF图基准和比较与基线建立在顶部的gSpan,一个国家的最先进的算法来检测频繁的模式。结果证明了所提出的方法的效率,并表明我们的技术能够减少执行时间的基线方法在至少三个数量级减少RDF图的大小高达66.56%。

英文摘要:

Knowledge graphs have become a popular formalism for representing entities and their properties using a graph data model, e.g., the Resource Description Framework (RDF). An RDF graph comprises entities of the same type connected to objects or other entities using labeled edges annotated with properties. RDF graphs usually contain entities that share the same objects in a certain group of properties, i.e., they match star patterns composed of these properties and objects. In case the number of these entities or properties in these star patterns is large, the size of the RDF graph and query processing are negatively impacted; we refer these star patterns as frequent star patterns. We address the problem of identifying frequent star patterns in RDF graphs and devise the concept of factorized RDF graphs, which denote compact representations of RDF graphs where the number of frequent star patterns is minimized. We also develop computational methods to identify frequent star patterns and generate a factorized RDF graph, where compact RDF molecules replace frequent star patterns. A compact RDF molecule of a frequent star pattern denotes an RDF subgraph that instantiates the corresponding star pattern. Instead of having all the entities matching the original frequent star pattern, a surrogate entity is added and related to the properties of the frequent star pattern; it is linked to the entities that originally match the frequent star pattern. We evaluate the performance of our factorization techniques on several RDF graph benchmarks and compare with a baseline built on top of gSpan, a state-of-the-art algorithm to detect frequent patterns. The outcomes evidence the efficiency of proposed approach and show that our techniques are able to reduce execution time of the baseline approach in at least three orders of magnitude reducing the RDF graph size by up to 66.56%.

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

↑