Discovery of Keys for Graphs

An Efficient Approach for Discovering Graph Entity Dependencies (GEDs)

“…More related to this work, are techniques for rule discovery in property graphs. Examples of some notable works in this area include: 1) [17,27,55,56,57], which investigated the discovery of association rules in property graphs; and 2) [12,16,22,58] on mining keys and dependencies in property graphs-closest to this work. In particular, [12] presents a frequent sub-graph expansion based approach for mining keys in property graphs, whiles [16] proposes efficient parallel graph functional dependency discovery for large property graphs.…”

“…Examples of some notable works in this area include: 1) [17,27,55,56,57], which investigated the discovery of association rules in property graphs; and 2) [12,16,22,58] on mining keys and dependencies in property graphs-closest to this work. In particular, [12] presents a frequent sub-graph expansion based approach for mining keys in property graphs, whiles [16] proposes efficient parallel graph functional dependency discovery for large property graphs. It is noteworthy that, the discovered rules (GEDs) in this work subsume the semantics of rules returned in [12] (i.e., GKeys) and in [16] (i.e., GFDs).…”

“…In particular, [12] presents a frequent sub-graph expansion based approach for mining keys in property graphs, whiles [16] proposes efficient parallel graph functional dependency discovery for large property graphs. It is noteworthy that, the discovered rules (GEDs) in this work subsume the semantics of rules returned in [12] (i.e., GKeys) and in [16] (i.e., GFDs).…”

“…In this work, motivated by the expressivity and usefulness of GEDs in many downstream applications, we study the problem of automatically learning GEDs from a given property graph. To the best of our knowledge, at the moment, no discovery algorithm exists in the literature for GEDs, albeit discovery solutions have been proposed for GKeys and GFDs in [12] and [16] respectively. Unfortunately, both solutions cannot be directly used to find GEDs, without changing the pattern matching semantics (i.e., isomorphic vs homomorphic matches); and even then, [16,12] can only discover subsets of the valid GEDs in the given graph.…”

“…To the best of our knowledge, at the moment, no discovery algorithm exists in the literature for GEDs, albeit discovery solutions have been proposed for GKeys and GFDs in [12] and [16] respectively. Unfortunately, both solutions cannot be directly used to find GEDs, without changing the pattern matching semantics (i.e., isomorphic vs homomorphic matches); and even then, [16,12] can only discover subsets of the valid GEDs in the given graph. Thus, the need for effective and efficient techniques for mining rules that capture the full GED semantics still exists.…”