Date : Jan. 31, 2019, 1 p.m. - Room :Salle du conseil
Foundational Approaches to Graph Query Processing
Stefania DUMBRAVA, Post-doctorante - INRIA Rennes
Modern graph query engines are gaining momentum, driven by exponentially growing, interconnected data volumes that populate scientific and industrial repositories, as part of the Linked Open Data and the Semantic Web. This marks a paradigm shift from relational and NoSQL data models to graph-based ones, such as the recently introduced property graph model. While successful commercial implementations exist, no standard graph query language has emerged and, despite the mature tools developed in the formal methods community and the security-sensitive applications currently involving graph-shaped data, no principled framework for the reliable evaluation of such queries has been proposed. In this talk, I will explain how we can address these issues, by employing the Coq proof assistant to develop a mechanically-certified engine for evaluating graph queries and for incrementally maintaining materialized graph instances, also called views. The language we use for defining queries and views is Regular Datalog (RD) -- a notable fragment of non-recursive Datalog that can express complex navigational queries, with transitive closure as a native operator. To this end, we mechanize an RD-specific evaluation algorithm capable of fine-grained, incremental graph view computation, which we prove sound with respect to the declarative RD semantics. By using the Coq program extraction mechanism, we test an OCaml version of the verified engine on a set of preliminary benchmarks, confirming the feasibility of obtaining a unified, machine-verified, formal framework for dynamic graph query languages and their evaluation engines. I will conclude by briefly presenting follow-up work, which takes into account alternative query processing techniques, and by outlining future research directions.