A Dependency-Extended Method of Multi-pattern Matching for RDF Graph

The problem of multi-pattern matching for RDF graph is an extended problem of subgraph isomorphism, where Resource Description Framework (RDF) is a graph-based data model for information sharing on Web. In real world, concurrent execution of multi-queries is more realistic than single query. However, the problem about re-computations of common subgraphs always limits the time efficiency of matching processing. To solve this problem, an algorithm of multi-pattern matching for RDF graph is proposed, which can response to multiple queries through one traversal of RDF graph. The experimental results show that our algorithm can avoid the re-computations of common subgraphs and improve up to 70\(\%\) of time efficiency than basic line algorithm.