Title:   Query reformulation under constraints
Speaker: Alin Deutsch (UCSD)

Abstract:

Many classical database problems such as semantic optimization
(i.e. rewriting using semantic constraints), minimization,
rewriting using views, equivalent query reformulation in
data publishing and integration, are particular instances of query 
reformulation under constraints.

The talk will present the Chase&Backchase algorithm which is sound and 
complete for finding all reformulations of a conjunctive query in the 
presence of constraints expressed as embedded dependencies (these 
capture all prevalent integrity constraints such as keys, foreign keys, 
etc.).

The Chase&Backchase thus provides a uniform solution to the above 
problems. As it turns out, this solution is applicabile also to 
object-oriented and XML settings.
An online demo of the Chase&Backchase method can be found at 
http://cb.ucsd.edu (thanks to Nicola Onose and Emiran Curtmola).