Datalog containment and hidden web queries
- Speaker: Professor Michael Benedikt, Department of Computer Science, Oxford
- Date: Tuesday, 14 May 2013 from 16:30 to 17:30
- Location: Room 160, Birkbeck Main Building
The implication/containment problem for the basic recursive query language Datalog has been studied in the database literature for decades. It is known to be undecidable in general, but several decidable subclasses were identified, for example, Monadic Datalog. However, the exact complexity of the problem is not fully understood. In this talk I will overview new techniques for pinpointing how hard containment is for some important subclasses of Datalog, including those that arise from querying the "hidden web" -- data hidden behind web forms.
Time permitting, I will also discuss other work being done in Oxford on querying the hidden web, including, generating query plans and discovering access patterns.
This talk includes joint work with Pierre Bourhis, Georg Gottlob, and Pierre Senellart.