Friday 18th March, 12:15, room 310

posted 10 Mar 2016, 04:09 by Jakub Michaliszyn
Piotr Wieczorek

Learning and teaching tree pattern queries

Tree patterns are standard mechanism for querying tree and graph databases.
I would like to discuss  the problem of learning such queries from positive examples, the learning framework as well as to give some intutitions behing the learning algorithms.
I show you well-behaving and practical class of anchored tree patterns with motivation why this class is so important in the context.
Finally, I will say few words on the following problem of teaching:  For a given query Q, does there exist a finite set of examples CS(Q) such that no other query is consistent with CS(Q)? 

The talk is based on join work with Slawek Staworko  presented at ICDT 2012 and ICDT 2015