グラフコーディングを用いたスーパーグラフ検索の効率化

抄録

In this paper, we propose an efficient method for indexing and searching graphs for the supergraph component search problem. The problem is to find graphs contained by a given query graph from a graph database consisting of many graphs. While the conventional methods use frequent subgraph patterns in the database to construct an index for the database, the proposed method uses subgraph patterns which are infrequent for its index. In our experimental evaluation, we show one order of magnitude improvement by our proposed method compared with the conventional method.