发现用于属性图画像的图生成依赖
Discovering Graph Generating Dependencies for Property Graph Profiling
AI总结:
本文提出GGDMiner框架,通过预处理、候选生成和GGD提取三个步骤自动发现近似图生成依赖(GGDs),并利用Answer Graph优化内存与执行时间,为用户提供输入图的模式信息及模式与属性间的相关性概览。
摘要:
随着图结构数据使用的增加,对图数据依赖及其应用(例如图数据画像)的研究兴趣也日益增长。图生成依赖(GGDs)是一类针对属性图的依赖关系,能够基于属性相似性表达不同图模式与约束之间的关系。GGDs丰富的语法和语义使其成为图数据画像的良好候选。然而,手动定义GGDs十分困难,尤其是在没有数据专家可用的情况下。在本文中,我们提出了GGDMiner,这是一个自动从图数据中发现近似GGDs的框架,旨在通过GGDs为用户进行图数据画像。GGDMiner包含三个主要步骤:(1)预处理,(2)候选生成,以及(3)GGD提取。为了优化内存消耗和执行时间,GGDMiner对每个发现的图模式使用一种因子化表示,称为Answer Graph。我们的结果表明,发现的GGDs集合能够提供关于输入图的概览,包括模式层面的信息以及图模式与属性之间的相关性。
英文摘要:
With the increasing use of graph-structured data, there is also increasing interest in investigating graph data dependencies and their applications, e.g., in graph data profiling. Graph Generating Dependencies (GGDs) are a class of dependencies for property graphs that can express the relation between different graph patterns and constraints based on their attribute similarities. Rich syntax and semantics of GGDs make them a good candidate for graph data profiling. Nonetheless, GGDs are difficult to define manually, especially when there are no data experts available. In this paper, we propose GGDMiner, a framework for discovering approximate GGDs from graph data automatically, with the intention of profiling graph data through GGDs for the user. GGDMiner has three main steps: (1) pre-processing, (2) candidate generation, and, (3) GGD extraction. To optimize memory consumption and execution time, GGDMiner uses a factorized representation of each discovered graph pattern, called Answer Graph. Our results show that the discovered set of GGDs can give an overview about the input graph, both schema level information and also correlations between the graph patterns and attributes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。