论文标题

可扩展知识图分析的语义属性图

Semantic Property Graph for Scalable Knowledge Graph Analytics

论文作者

Purohit, Sumit, Van, Nhuy, Chin, George

论文摘要

图是描述各种复杂系统的活动,关系和演变的自然而基本的表示。沟通,引用,采购,生物学,社交媒体和运输等许多领域都可以建模为一组实体及其关系。资源说明框架(RDF)和标记的属性图(LPG)是图形中编码信息的两个最常用的数据模型。在使用基本图元素(例如节点和边缘)方面,这两种模型都相似,但在建模方法,表达性,序列化和目标应用方面有所不同。 RDF是一种灵活的数据交换模型,用于表达有关实体的信息,但它往往具有高内存足迹和效率低下的存储,这并不是执行可扩展图分析的自然选择。相比之下,LPG在执行可扩展的图形分析任务(例如子图形匹配,网络对齐和实时知识图形查询)中获得了可靠的模型。它提供有效的存储,快速遍历和灵活性,以建模各种现实世界域。同时,LPG缺乏正式知识表示的支持,例如提供自动化知识推断的本体论。我们将语义属性图(SPG)作为REDIFIED RDF的逻辑投影介绍到LPG模型中。 SPG继续使用RDF本体来定义投影图的类型层次结构,并根据给定的本体论进行验证。我们提出了一个框架,使用两个不同的计算环境将资助的RDF图转换为SPG。我们还使用Amazon Web服务提供了基于云的图形迁移功能。

Graphs are a natural and fundamental representation of describing the activities, relationships, and evolution of various complex systems. Many domains such as communication, citation, procurement, biology, social media, and transportation can be modeled as a set of entities and their relationships. Resource Description Framework (RDF) and Labeled Property Graph (LPG) are two of the most used data models to encode information in a graph. Both models are similar in terms of using basic graph elements such as nodes and edges but differ in terms of modeling approach, expressibility, serialization, and target applications. RDF is a flexible data exchange model for expressing information about entities but it tends to a have high memory footprint and inefficient storage, which does not make it a natural choice to perform scalable graph analytics. In contrast, LPG has gained traction as a reliable model in performing scalable graph analytic tasks such as sub-graph matching, network alignment, and real-time knowledge graph query. It provides efficient storage, fast traversal, and flexibility to model various real-world domains. At the same time, the LPGs lack the support of a formal knowledge representation such as an ontology to provide automated knowledge inference. We propose Semantic Property Graph (SPG) as a logical projection of reified RDF into LPG model. SPG continues to use RDF ontology to define type hierarchy of the projected graph and validate it against a given ontology. We present a framework to convert reified RDF graphs into SPG using two different computing environments. We also present cloud-based graph migration capabilities using Amazon Web Services.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源