Core Concepts
The authors propose a schema-based query rewriting approach to optimize graph queries by injecting relevant structural information from a graph schema. This method aims to improve query performance and reduce the size of intermediate subquery results.
Abstract
The content discusses the importance of recursive graph queries in various domains and introduces a type inference mechanism to enrich queries with schema information. It highlights the challenges of optimizing recursive queries and presents a prototype implementation demonstrating the practical application of the schema-based approach.
Stats
Recursive graph queries are popular for extracting interconnected data.
Schema information can improve query evaluation and performance.
Prototype implementation focuses on translating schema-based rewritten queries into recursive relational algebra.
Experimental evaluation conducted on property graphs and knowledge graphs.
Proposed approach effective for acyclic-shaped recursive graph queries.