Flexible and Expressive Typed Path Patterns for GQL
summary
Defines FPPC — a formal type calculus for a core GQL fragment that adds property filters and imprecise (unknown) types, and statically flags queries that are definitely empty or potentially stuck. Proves emptiness (typed-empty implies runtime-empty), type safety (well-typed queries do not get stuck) and the gradual guarantee for removing annotations. Ships a Python prototype that produces diagnostics for incompatible shapes, missing attributes and unbound variables and whose artifacts are available and reproducible.
AI-written summary · about
chapters (10)
- 0:00Typed path patterns in GQL
- 1:02What is GQL
- 3:11Graph query challenges
- 6:48Type system goals
- 7:53FPPPC calculus
- 9:37Type system error detection
- 11:02Prototype and feedback
- 12:25Key contributions
- 13:30Future work
- 13:53Q&A
related talks
45mGraph databases, PostgreSQL and SQL/PGQ
27mExploring property graphs with SQL/PGQ in PostgreSQL
23mType-Level Programming with Match Types
40mFunction-Passing, A New Model for Typed, Asynchronous and Distributed Programming
52mPattern Functors...
17mFixpoints for the Masses: Programming with First-Class Datalog Constraints
31mWhen property graphs join SQL
01h 03mHow to use Phantom Types and Existential Types in Production