关键词: 超图集合查询, 特征, 索引

Abstract: This paper proposes an approach for processing supergraph set query in graph database, filtering- verification schema is selected in the algorithm, the filter is an index tree based on features mined from databsae. Fast algorithm for extracting features from databases is provided, it also gives method for constructing index. Organizing features in a tree make that the common induced subgraph of two or more features can be isomorphicly mapped into query only once. In verification phase, Ullman algorithm together with finding maximum cliuqe algorithm processes subgraph isomorphism test.

Key words: supergraph set query, feature, index