Title: Adaptive Query Processing with Eddies
Speaker: Amol Deshpande, Univ. Maryland, College Park
Date/Time:  Tue Jan 10, 2006, 2.00 - 3.15 PM
Location:  SIC 301
Note: This lecture will be part of the CS 632 course

                                                                              
 Abstract:
Adaptive query processing has emerged as an attractive solution to dynamicallychanging runtime environments, and unknown data distributions in many
scenarios.  These scenarios involve querying over web sources where little
information is usually available about the data sources, continuous query
processing where the data characteristics change frequently, and even single
site database systems where in many cases, only unreliable statistics are
available. Probably the most aggressive of the adaptive query processing
techniques proposed is eddies, which continuously reoptimizes a query by
changing the order in which operators are applied to tuples on a 
per-tuple basis.
                                                                              
In this talk, I will present an overview of the eddies architecture as
originally proposed by Avnur and Hellerstein (SIGMOD 2000), and discuss
some of the followup work on it (Madden et al SIGMOD 2002, Raman et al
ICDE 2003, Deshpande et al VLDB 2004), especially in the context of 
continuous query processing over data streams. I will also present and 
discuss some of the open problems in this area in detail.
                                                                              
Bio:
Amol Deshpande is an Assistant Professor at University of Maryland
at College Park. He received his B.Tech. from IIT Bombay, and his
PhD from UC Berkeley in 2004. His research interests are
Database Management Systems, in particular, query processing
and optimization in database systems, data management in
Sensor Networks, and integration of probabilistic
and statistical models into database systems.