[Please remove <h1>]
Spring 2005
Note: Events of interest to the
Database Research Group are posted to the uw.cs.database
newsgroup and are mailed to the dbgroup mailing lists: db-faculty
(for DB group faculty), db-grads (for DB group graduate students),
and db-friends (for DB group alumni, visitors, and friends). If
you wish to subscribe to one of these lists, send mail to
majordomo@db
with "subscribe <list>" in the message body, where
<list> is the list you wish to subscribe to. For example,
use "subscribe db-friends" to subscribe to the db-friends list. To
unsubscribe, send "unsubscribe <list>" to the same address.
- DB group
meetings
- The DB group meets most Friday afternoons at 2pm, usually in DC1331.
See the list of current events for
times and locations of upcoming meetings. Each meeting lasts
for an hour and features an informal presentation by one of the
members of the group. Everyone is welcome to attend. These talks are
intended to raise questions and to stimulate discussion rather than
being polished presentations of research results. Speakers are determined
using a rotating speaker list, which can be found on the DB group meeting page
- DB seminar
series
- The DB seminar series features visiting speakers. These seminars are
more-or-less monthly, and are usually scheduled on Monday
mornings at 11am. See the list of current
events for times and locations of upcoming seminars. The
full schedule can be found on the DB seminar
series page.
Recent and Upcoming Events
DB meeting: |
Friday May 6, 2:00pm, DC1331 |
Speaker: |
Ye Qin
|
Topic: |
I am going to present the following paper:
"Adaptive Overlapped Declustering: A Highly Available Data-Placement
Method Balancing Access Load and Space Utilization" by
Akitsugu Watanabe and Haruo Yokota, from ICDE'05.
|
DB meeting: |
Friday May 27, 2:00pm, DC1331 |
Speaker: |
Tony Young
|
Title: |
Benchmarking DBMS's for Communication Cost Analysis
|
Abstract: |
Federated database systems are a useful tool for businesses
and researchers around the world. These systems allow data from
multiple remote data sources to be logically combined into one
unified local data source. Using this system, queries that would
traditionally require query fragments to be submitted to multiple
sites can be performed by submitting one query to a central site.
This central site can make use of data stored at the different remote
sources as though the central site were simply an application
requesting data.
These so-called global queries must be optimized, but many additional
factors combine to make global query optimization complicated. Beyond
the problems of local query optimization, additional costs, including
the cost of communication, the cost of remote site optimization,
etc., must be factored into cost models. Currently, the performance
of global queries in iAnywhere Adaptive Server Anywhere is much worse
than the performance of local queries.
This talk presents some background material on federated database
systems including information regarding benchmarking performed at
iAnywhere Solutions, Inc. during a cooperative work term. A
discussion of the results of this benchmarking as well as some
initial recommendations for improving the performance of global
queries will be presented. Some future work is also outlined.
|
DB meeting: |
Friday June 3, 2:00pm, DC1331 |
Speaker: |
Peter Bumbulis
|
Topic: |
I will present S. Bansal and D. Modha, "CAR: Clock with Adaptive Replacement",
Proceedings of the 3nd USENIX Symposium on File and Storage Technologies,
March, 2004
(available as http://www.almaden.ibm.com/cs/people/dmodha/clockfast.pdf).
It's a follow on to N. Megiddo and D. S. Modha, "ARC: A self-tuning,
low overhead replacement cache", Proceedings of the 2nd USENIX Conference
on File and Storage Technologies, March 2003.
|
WSC Lunch Seminar: |
Tuesday June 7, noon, DC1302 |
Speaker: |
Gary Promhouse, Chief Scientist, Open Text Corporation
|
Title: |
Enterprise Content Management (ECM) Application Backend Needs
|
Abstract: |
Most large software systems today use a three-tier architecture, with
simple Web clients, the bulk of the business logic in a middle layer,
and a back end layer generally using a standard RDBMS. For ECM
applications, such as those built by Open Text, the facilities provided
by those RDBMSes are problematic in a number of areas. General solutions
to some of these problems could be useful to many other applications as
well. This talk will review those ECM application needs, the
characteristics of the RDBMSes that do not support those needs well, and
some possible directions that could be taken to address those issues.
|
DB meeting: |
Friday June 10, 2:00pm, DC1331 |
Speaker: |
Ashraf Aboulnaga
|
Topic: |
I will discuss k-anonymity in databases, focusing on the following
SIGMOD 2005 paper:
Kristen LeFevre, David J. DeWitt, and Raghu Ramakrishnan,
"Incognito: Efficient Full-Domain
K-Anonymity".
|
CS848 Guest Lecture: |
Wednesday June 22, 2:00pm, FLEX Lab (Dana Porter Library, Room LIB 329) |
Speaker: |
Surajit Chaudhuri, Microsoft Research (by teleconference)
|
Title: |
Self-tuning Features in Microsoft SQL Server
|
DB meeting: |
Friday June 24, 2:00pm, DC1331 |
Speaker: |
Matthew Young-Lai
|
Topic: |
I'll overview the intra-query parallelism capabilities that have recently
been added to SQL Anywhere.
Most of the focus will be on the execution model. If there's time, I'll
also talk about the costing and
optimization.
|
CS848 Guest Lecture: |
Wednesday June 29, 2:00pm, FLEX Lab (Dana Porter Library, Room LIB 329) |
Speaker: |
Benoit Dageville, Karl Dias, and Leonidas Galanis, Oracle (by teleconference)
|
Title: |
Self-management Features in Oracle 10g
|
CS848 Guest Lecture: |
Wednesday July 6, 2:00pm, DC3313 |
Speaker: |
Glenn Paulley, Sybase iAnywhere
|
Title: |
Self-management Features in Sybase iAnywhere
|
DB meeting: |
Friday July 8, 2:00pm, DC1331 |
Speaker: |
M. Tamer Özsu
|
Title: |
Discussion of paper " Impact Of Search Engines On Page Popularity"
from WWW04.
|
Abstract: |
I'll discuss this paper which discusses how much impact search
engines have on the popularity (and therefore the ranking) of pages on the
Web. From the abstract: "Recent studies show that a majority of Web page
accesses are referred by search engines. In this paper we study the
widespread use of Web search engines and its impact on the ecology of the
Web. In particular, we study how much impact search engines have on the
popularity evolution of Web pages. For example, given that search engines
return currently "popular" pages at the top of search results, are we
somehow penalizing newly created pages that are not very well known yet? Are
popular pages getting even more popular and new pages completely ignored?"
|
DB meeting: |
Friday July 15, 2:00pm, DC1331 |
Speaker: |
Heng Yu
|
Title: |
On Decoupling Concurrency Control from Recovery in Database Repositories
|
Abstract: |
We report on initial research on the concurrency control
issue of compiled database applications. We focus
on decoupling concurrency control from any functionality
relating to recovery. Because it is the possibility of
transaction aborts for deadlock resolution that makes the
recovery subsystem necessary, we choose the deadlock-free
tree locking (TL) scheme for our purpose. With the knowledge
of transaction workload, efficacious lock trees for runtime
control can be determined at compile-time. Our experimental
results show TL produces better throughput than the
traditional two-phase locking (2PL) when the transactions
are write-only; and for main-memory data, TL performs
comparably to 2PL even in workloads with many reads.
|
This page is maintained by
Ken
Salem.