论文标题
发现图的键[扩展版本]
Discovery of Keys for Graphs [Extended Version]
论文作者
论文摘要
图形键使用唯一识别图形数据库中实体所需的拓扑和值约束。已经对它们进行了研究，以支持对象识别，知识融合，数据删除和社交网络对帐。在本文中，我们将算法介绍给图形上的键。我们的算法通过频繁的子图扩展在图中发现键。我们提出了定义有意义的钥匙的两个属性，包括最小和支持。最后，使用现实图表，我们通过实验验证了对现实世界图的算法的效率。
Keys for graphs uses the topology and value constraints needed to uniquely identify entities in a graph database. They have been studied to support object identification, knowledge fusion, data deduplication, and social network reconciliation. In this paper, we present our algorithm to mine keys over graphs. Our algorithm discovers keys in a graph via frequent subgraph expansion. We present two properties that define a meaningful key, including minimality and support. Lastly, using real-world graphs, we experimentally verify the efficiency of our algorithm on real world graphs.
