IC Monday Seminar : The Case of Full Relational Algebra Queries in Probabilistic Databases
Event details
| Date | 17.01.2011 |
| Hour | 16:15 |
| Speaker | Prof. Dan Olteanu, Computing Laboratory, University of Oxford, invited by Prof. Christoph Koch |
| Location |
INM 202
|
| Category | Conferences - Seminars |
Abstract : In this talk I will discuss recent advances on the evaluation of full relational algebra queries in expressive probabilistic databases. In the exact case, I will discuss the tractability of practical quantified queries such as set inclusion and relational division, as well as queries with negation. In the approximate case, I will show how to derive lower and upper bound queries that can be computed more efficiently. We cast this problem as an approximation problem for propositional formulas: Given a formula in a language such as disjunctive normal form, find two formulas in a possibly more restricted language, such as read-once formulas, that are lower and upper bounds, respectively, of the input formula. This query evaluation framework is implemented in the SPROUT query engine.
This is joint work with Robert Fink and Swaroop Rath.
Bio : Dan Olteanu joined Oxford University Computing Laboratory in September 2007. He holds a Dipl.Ing. in Computer Science from Polytechnic University of Bucharest and a PhD in Computer Science from Ludwig Maximilian University of Munich. Before joining Oxford, he was a post-doctoral researcher at Saarland University in Saarbruecken, a visiting scientist at Cornell University in Ithaca, and a temporary professor at Ruprecht Karl University in Heidelberg.
Practical information
- General public
- Free
Contact
- Christine Moscioni