Sciweavers

Share
EDBT
2008
ACM

A novel spectral coding in a large graph database

10 years 3 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recognition. Because sub-graph isomorphism is a NP-complete problem [4], we have to employ a filter-and-verification framework to speed up the search efficiency, that is, using an effective and efficient pruning strategy to filter out the false positives (graphs that are not possible in the results) as many as possible first, then validating the remaining candidates by subgraph isomorphism checking. In this paper, we propose a novel filtering method, a spectral encoding method, i.e. GCoding. Specifically, we assign a signature to each vertex based on its local structures. Then, we generate a spectral graph code by combining all vertex signatures in a graph. Based on spectral graph codes, we derive a necessary condition for sub-graph isomorphism. Then we propose two pruning rules for sub-graph search problem, and p...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2008
Where EDBT
Authors Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
Comments (0)
books