Database Research Group Events

Spring 2006

Note: Events of interest to the Database Research Group are posted to the uw.cs.database newsgroup and are mailed to the mailing list. There are actually three mailing lists aggregated into the db-group list: 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 three lists (or to unsubscribe), please visit<listname>, where <listname> is the list you wish to subscribe to.
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 5, 2:00pm, DC1331
Speaker: Ani Nica, Sybase iAnywhere
Title: Adaptive Query Processing in Database Management Systems
Abstract: This talk will contain a survey of the literature on the adaptive query processing techniques in Database Management Systems. The goal of the talk is to compare and contrast the main techniques of adaptive query processing such as proactive reoptimization, reactive reoptimization, and adaptive architectures for execution. The talk will also include examples of how these ideas are implemented in the commercial database management systems.

DB Meeting: Friday May 12, 2:00pm, DC1331
Speaker: Jérémy Barbay
Title: Adaptive Search Algorithm for Patterns, in Succinctly Encoded XML
Abstract: We propose an adaptive algorithm for context queries (queries expressed as preorder and ancestor-descendant relations on labeled nodes), which can be used to find patterns in XML documents. Our algorithm takes advantage of the correlation between terms of the query without any preprocessed information, and it runs in time (kd(lg lg min(n,s)+lg lg(r))) in the RAM model, where k is the number of terms in the query, d is the non-deterministic complexity of the query on the multi-labeled tree (i.e. the minimum number of operations required to check the answer to the query), n is the number of nodes in the tree, s is the number of relations between nodes and labels, and r is the maximal number of nodes matching a label on any rooted path in the tree.

This a work in progress, that I plan to finish for this summer. Preliminary results are available in technical report 11 (on the web when Jessica will update it), I want to push them further by using some problems and techniques introduced by Bruno et al. [SIGMOD 2002], eventually in collaboration with people working in Databases.

DB Seminar: Monday May 15, 11:00am, MC5136 (Please note room change)
Speaker: Walid Aref, Purdue University
Title: Nile: Data Streaming in Practice

DB Meeting: Friday May 19, 2:00pm, DC1331
Speaker: Qiang Wang
Title: P2P tree overlays and in-network query processing
Abstract: While tree is a core data structure widely used in centralized DBMS, it is recently employed in designing P2P overaly networks. In this presentation, we will first visit Chord, a major structured P2P network, whose topology is based on a ring, but the long-range routing links spawns a spanning binomial tree. The binomial tree comes up with logarithmic routing efficiency, however, its unbalanced feature may lead to load-balancing problems, so next I will overview Baton/VBI, a balanced-tree overlay network. Baton/VBI is based on a balanced binary tree structure, using AVL-like rotation to maintain balance and using in-level long-range links to improve fault-tolerance. Baton/VBI obtains both logarithmic routing efficiency and load-balancing, however, the maintenance cost can be nontrivial. Thus, further, I want to discuss randomized tree overlays based on Skiplist structure, which employs randomization rather than explicit maintenance to obtain desirable features. Closely based on the design of the tree overlays, I will also describe how to realize important query processings (e.g., range query processing, ranking query processing) in P2P environments.

DB Meeting: Friday May 26, 2:00pm, DC1331
Speaker: Shai Ben-David
Topic: Online detection of change in stream generating distributions

DB Meeting: Friday June 2, 2:00pm, DC1331
Speaker: Ian McKillop
Title: Databsae Issues in Health Informatics

DB Seminar: Monday June 5, 11:00am, DC1304
Speaker: Christos Faloutsos, CMU
Title: Data Mining using Fractals and Power Laws

DB Meeting: Friday June 9, 2:00pm, MC5158 (Please note room change)
Speaker: Robert Warren
Title: Non traditional string similarity measures

DB Meeting: Friday June 16, 2:00pm, DC1331
Speaker: Glenn Paulley, Sybase iAnywhere
Title: Self-management Features in SQL Anywhere
Abstract: SQL Anywhere is the small-footprint database product developed by iAnywhere Solutions here in Waterloo.

In this talk, I will outline some of the features of SQL Anywhere that make it an appropriate choice for envionmrnents where the database server is embedded with the database application itself, and (typically) installed as a single unit. In these environments the number of concurrent users can range from 1 to the 100's, and the hardware platform can range from MS Windows desktop and laptop machines, to high-end linux boxes, to handheld devices running Windows CE, and everything in between.

Our approach in engineering SQL Anywhere is to aggressively make the server as self-tuning (and self-managing) as possible, without the need for turning performance "knobs" (or have the 3rd-party user execute tuning "tools" on-site, which amounts to the same thing). In various ways, our self-management techniques in this embedded environment predated the current emphasis on "autonomic computing" (by IBM), and Microsoft's "Auto-Admin" projects, by nearly a decade.

DB Meeting: Friday June 23, 2:00pm, DC1331
Speaker: Ye (Brian) Qin
Topic: DBMS Optimizers Need Accurate I/O Cost Models

DB Meeting: Friday July 7, 2:00pm, DC1331
Speaker: Mohammed Abouzour, Sybase iAnywhere
Title: Automatic Tuning Database Server Multiprogramming Level
Abstract: Many commercial database servers have a parameter that controls the multiprogramming level of the server. I will be talking about what the issues with setting this parameter are and discuss an automatic tuning algorithm and two variations on this algorithm. I will show comparison results on how each of these variations compare.

DB Seminar: Monday July 10, 11:00am, DC1304
Speaker: Guido Moerkotte, University of Mannheim
Title: Dynamic Programming for Join Ordering Revisited

DB Meeting: Friday July 21, 2:00pm, DC1304 (Please note room change)
Speaker: Ihab Ilyas
Title: RankSQL: Supporting Ad-hoc Ranking Aggregates in Relational Databases

MMath Seminar: Tuesday July 25, 1:00pm, DC 1316
Speaker: E. Cem Sözgen
Title: XCache: On-line View Selection and Caching for XML Databases

DB Seminar: Wednesday July 26, 11:00am, DC1304 (Please note unusual day)
Speaker: Jennifer Widom, Stanford University
Title: A System for Data, Uncertainty, and Lineage

This page is maintained by Ashraf Aboulnaga.

Campaign Waterloo

Data Systems Group
David R. Cheriton School of Computer Science
University of Waterloo
Waterloo, Ontario, Canada N2L 3G1
Tel: 519-888-4567
Fax: 519-885-1208

Contact | Feedback: | Data Systems Group

Valid HTML 4.01!Valid CSS! Last modified: Friday, 01-Jun-2012 11:01:03 EDT