A Rule-Based Procedure for Graph Query Solving
We consider a core language for graph queries. These queries are seen as formulas to be solved with respect to graph-oriented databases. For this purpose, we first define a graph query algebra where some operations over graphs and sets of graph homomorphisms are specified. Then, the notion of pattern is introduced to represent a kind of recursively defined formula over graphs. The syntax and formal semantics of patterns are provided. Afterwards, we propose a new sound and complete procedure to solve patterns. This procedure, which is based on a set of rewriting rules, is terminating and develops only one needed derivation per pattern to be solved. Our procedure is generic in the sense that it can be adapted to different kinds of graph queries provided that the notions of graph and graph homomorphism (match) are well defined.
Thu 20 JulDisplayed time zone: London change
11:00 - 12:30 | ICGT Session 6: ApplicationsResearch Papers at Willow Chair(s): Kazunori Ueda Waseda University Remote Participants: Zoom Link, YouTube Livestream | ||
11:00 30mTalk | A Rule-Based Procedure for Graph Query Solving Research Papers Dominique Duval Université Grenoble Alpes, P: Rachid Echahed University of Grenoble - CNRS, Frederic Prost Université Grenoble Alpes DOI | ||
11:30 30mTalk | Formalization and analysis of BPMN using graph transformation systemsICGT Best Applications Paper Research Papers P: Tim Kräuter Western Norway University of Applied Sciences, Adrian Rutle Western Norway University of Applied Sciences, Harald König University of Applied Sciences, FHDW Hannover and Western Norway University of Applied Sciences, Yngve Lamo Western Norway University of Applied Sciences DOI Pre-print File Attached | ||
12:00 30mTalk | Dominant Eigenvalue-Eigenvector Pair Estimation via Graph Infection Research Papers P: Kaiyuan Yang University of Zurich, Li Xia National University of Singapore, Y.C. Tay National University of Singapore DOI Pre-print |