Flexible and Expressive Typed Path Patterns for GQL

Explore a conference presentation that introduces a formal type model for the Graph Query Language (GQL), addressing critical gaps in the ISO standard for querying graph databases. Learn about the FPPC (Flexible and Expressive Typed Path Patterns) model developed by researchers from multiple international institutions, which extends GQL with property-based filtering and imprecise types to enable static detection of semantically incorrect queries. Discover how this type system prevents runtime failures and empty results by providing compile-time validation, particularly beneficial when working with large-scale knowledge graphs in domains like biology, fraud detection, supply chain management, and investigative journalism. Understand the theoretical foundations including emptiness detection for identifying queries that will return no results due to type mismatches, type safety guarantees that well-typed queries won't fail at runtime, and gradual guarantee properties that ensure removing type annotations doesn't introduce static errors. Examine how the integration of imprecision into GQL provides flexibility for handling schema evolution and incomplete type information, making the language more robust and user-friendly. Gain insights into the practical applications across various industries and the formal mathematical properties that underpin this advancement in graph database query languages.