In this talk, we will consider the new graph query language GPath, which is a generalization of the XPath language for queries on trees, which is used for XML files analysis. It will be shown how these queries can be translated into a datalog program. The execution complexity of the obtained programs will also be considered. In addition, we will consider the issue of optimizing these queries using the well-known datalog technique --- magic-sets rewriting.
Presenter: Rustam Azimov
Date: December 3, 2018
Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28