A coding method for efficient subgraph querying on vertex- and edge-labeled graphs.

• Main Authors: Lei Zhu, Qinbao Song, Yuchen Guo, Lei Du, Xiaoyan Zhu, Guangtao Wang
• Format: Article
• Language: English
• Published: Public Library of Science (PLoS) 2014-01-01
• Series: PLoS ONE
• Online Access: http://europepmc.org/articles/PMC4031119?pdf=render

Labeled graphs are widely used to model complex data in many domains, so subgraph querying has been attracting more and more attention from researchers around the world. Unfortunately, subgraph querying is very time consuming since it involves subgraph isomorphism testing that is known to be an NP-complete problem. In this paper, we propose a novel coding method for subgraph querying that is based on Laplacian spectrum and the number of walks. Our method follows the filtering-and-verification framework and works well on graph databases with frequent updates. We also propose novel two-step filtering conditions that can filter out most false positives and prove that the two-step filtering conditions satisfy the no-false-negative requirement (no dismissal in answers). Extensive experiments on both real and synthetic graphs show that, compared with six existing counterpart methods, our method can effectively improve the efficiency of subgraph querying.