Queries for trees and graphs: static analysis and code synthesisColloque / Congrès / Forum Public-cible: Ouvert au grand public
The increasing availability of richly structured data in large volumes raises a number of questions and challenges. In particular, the interest in querying massive datasets raises challenges on how data and query computations should be distributed to achieve better performance and scalability. This leads to a renewed interest in the static analysis of queries. Static analysis involves solving fundamental problems at compile-time such as query satisfiability, query containment and equivalence. Major applications include: early detection of errors, redundancy elimination, faster access control with costs deferred at compile-time, query optimisation.
In this talk I will review advanced static analysis techniques for regular path queries over trees. I will also summarize the limits and what can be achieved with graph queries. I will then give an overview of our on-going work on code synthesis for graph queries, drawing some perspectives for further developments in the field.
Site PER 21
/ Salle E120
Bd de Pérolles 90, 1700 Fribourg
Department of Informatics
Prof. Philippe Cudré-Maurouxstephanie.firstname.lastname@example.org
Bd de Pérolles 90
+41 26 300 83 22
Dr. Pierre Geneves, CNRS, France