|
|
|
|
|
|
Keynote
Speech 1: Databases in a Wireless World David Yach,
VP Software, Research in Motion Download the Presentation Ballroom,
Tuesday, 9:00-10:30 The traditional view
of distributed databases is based on a number of database servers with
regular communication. Today information is stored not only in these central
databases, but on a myriad of computers and computer-based devices in
addition to the central storage. These range from desktop and laptop computers
to PDA's and wireless devices such as cellular phones and BlackBerry's.
The combination of large centralized databases with a large number and
variety of associated edge databases effectively form a large distributed
database, but one where many of the traditional rules and assumptions
for distributed databases are no longer true. This keynote will discuss
some of the new and challenging attributes of this new environment, particularly
focusing on the challenges of wireless and occasionally connected devices.
It will look at the new constraints, how these impact the traditional
distributed database model, the techniques and heuristics being used to
work within these constraints, and identify the potential areas where
future research might help tackle these difficult issues.
David Yach, VP Software, Research in Motion
Keynote
Speech 2: Structures, Semantics and Statistics Alon Halevy, University of Washington Download the Presentation Ballroom,
Wednesday, 9:00-10:30 Integration of data
from multiple sources is one of the longest standing problems facing the
database research community. In addition to being a problem in most enterprises
and in large-scale science projects, research on this topic has been fueled
by the promise of querying the WWW. I will begin by highlighting some
of the significant recent achievements in the field of data integration,
and will then focus on what I consider to be the main challenges going
forward, namely, large-scale reconciliation of semantic heterogeneity,
and on-the-fly information integration. To address these challenges, I
argue for an approach based on computing statistics over corpora of database
structures. At a fundamental level, the key challenge in data integration
is to reconcile the semantics of disparate data sets, each expressed with
different database structures. Computing statistics over a large corpus
of schemas and mappings offers a powerful methodology for producing semantic
mappings, the expressions that specify such reconciliation. In essence,
the statistics offer hints about the semantics of the symbols in the structures,
thereby enabling to detect when two symbols, from disparate schemas, should
be matched to each other. The same methodology can be applied to several
other data management tasks that involve search in a space of complex
structures. I will illustrate several examples where this approach has
been successful.
Alon Halevy, University of Washington
10
Year Best Paper Award: Whither Data Mining? Rakesh Agrawal,
Ramakrishnan Srikant (IBM Almaden Research Center) Ballroom,
Thursday 9:00-10:30 The last decade has
witnessed tremendous advances in data mining. We take a retrospective
look at these developments, focusing on association rules discovery, and
discuss the challenges and opportunities ahead. |