Symbolic Graph Query Solving

Property graphs play an important role in representing data bases in modern graph query languages. In this paper we focus on a particular class of graph queries known as Graph-to-Graph or CONSTRUCT queries. Such queries return graphs instead of tables when applied to actual Property Graphs. We propose a symbolic graph query solving procedure which combines rewriting techniques for goal solving as well as graph transformation techniques. The proposed procedure is proven sound and complete.