Fg-index: towards verification-free query processing on graph databases

By James Cheng, Yiping Ke, Wilfred Ng, An Lu. ACM SIGMOD Conference, 2007

299 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (2012, background): “The first subcategory includes GraphGrep [12], gIndex [16], FG-Index [1], Tree+Δ [19], gCode [20], SwiftIndex [11], and C-Tree [4].”
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases (2013, methodology): “There are graph-index based subgraph isomorphism algorithms such as gIndex [17, 18], FG-Index [2], Tree+Δ [22], SwiftIndex [12], C-Tree [19], and gCode [23].”
Graphs-at-a-time: query language and access methods for graph databases (2008, methodology): “FG-index [7] uses frequent subgraphs as index features.”
Mining significant graph patterns by leap search (2008, background): “[6]) demonstrated that through such vectorization, efficient indices could be built to support fast search in graphs.”
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (2008, methodology): “In [4], Cheng et al. propose a new paradigm, FG-Index, with the aim to use index only to process a subgraph containment query; that is, veriﬁcation free.”
GADDI: distance index based subgraph matching in biological networks (2009, methodology): “Many algorithms have been proposed to improve the effectiveness of the selected features, such as gIndex[46], TreePi[51], FG-Index[5] and Tree+d[52].”