BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Monday Seminar : The Case of Full Relational Algebra Queries in
  Probabilistic Databases
DTSTART:20110117T161500
DTSTAMP:20260921T194900Z
UID:576782308b3740f048b9c6793dd969493f6b0f6ddce0c2fb01270c98
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Dan Olteanu\, Computing Laboratory\, University of Oxfor
 d\, invited by Prof. Christoph Koch\nAbstract : In this talk I will discus
 s 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 re
 lational division\, as well as queries with negation. In the approximate c
 ase\, I will show how to derive lower and upper bound queries that can be 
 computed more efficiently. We cast this problem as an approximation proble
 m for propositional formulas: Given a formula in a language such as disjun
 ctive normal form\, find two formulas in a possibly more restricted langua
 ge\, such as read-once formulas\, that are lower and upper bounds\, respec
 tively\, of the input formula. This query evaluation framework is implemen
 ted in the SPROUT query engine.\nThis is joint work with Robert Fink and S
 waroop Rath.\n\nBio : Dan Olteanu joined Oxford University Computing Labor
 atory in September 2007. He holds a Dipl.Ing. in Computer Science from Pol
 ytechnic University of Bucharest and a PhD in Computer Science from Ludwig
  Maximilian University of Munich. Before joining Oxford\, he was a post-do
 ctoral researcher at Saarland University in Saarbruecken\, a visiting scie
 ntist at Cornell University in Ithaca\, and a temporary professor at Rupre
 cht Karl University in Heidelberg.
LOCATION:INM 202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR