Database Research Group Events

Spring 2010

Events of interest to the Database Research Group are posted here, and are also mailed to the uw.cs.database newsgroup and the db-faculty, db-grads, db-friends mailing lists. Subscribe to one of these mailing lists to receive e-mail notification of upcoming events.

The DB group meets Wednesday afternoons at 2:30pm. The list below gives the times and locations of upcoming meetings. Each meeting lasts for an hour and features either a local speaker or, on Seminar days, an invited outside speaker. Everyone is welcome to attend.

Recent and Upcoming Events

The 23rd International Workshop on Description Logics (DL 2010) Tuesday May 4 - Friday May 7th, DC 1302

DB Meeting: Wednesday May 12, 2:30pm, DC 1331
Speaker: Ani Nica
Title: Incremental Maintenance of Materialized Views in Database Management Systems
Abstract: In this talk I will highlight different techniques for incremental maintenance of materialized views in database management systems (DBMSs). The talk will include theoretical aspects of the problem as treated in the database research literature. As a case study, I will present the general architecture of the SQL Anywhere DBMS for supporting immediate materialized views, as well as detailed algorithms designed for SQL Anywhere which address some of the most interesting problems related to incremental maintenance of materialized views.

DB Meeting: Wednesday May 19, 2:30pm, DC 1331
Speaker: Ahmed Ataullah
Title: Business Policy Modeling for Relational Database Systems
Abstract: Database systems are subject to a wide array of business policies, rules and requirements. However there is no standard mechanism of integrating and reasoning about the business policies that manifest themselves as database level constraints. In this talk I will propose an extensible, low-level, process oriented and stateful policy modeling language that will attempt to reduce the manageability problems associated with a large number of business rules embedded within relational database systems.

DB Meeting: Wednesday May 26, 2:30pm, DC 1331
Speaker: Charlie Clarke
Title: Exploring current problems in Web search
Abstract: The TREC Web Track provides an opportunity to explore current problems in Web search using the billion-page ClueWeb09 dataset. Currently the track includes both a diversity task and a spam filtering task. I'll present an overview of last year's results, and provide some encouragement for interested participants.

DB Meeting: Wednesday June 2, 2:30pm, DC 1331
Speakers: Ashraf Aboulnaga, Jeff Pound, Ken Salem
Title: SIGMOD practice talks
  • Schema Clustering and Retrieval for Multi-domain Pay-As-You-Go Data Integration Systems (Ashraf)
  • Expressive and Flexible Access to Web-Extracted Data: A Keyword-based Structured Query Language (Jeff)
  • Workload-Aware Storage Layout for Database Systems (Ken)

DB Seminar: Friday June 4th, 2:30pm, DC 1331
Speaker: Wolfgang Lehner, TU Dresden
Title: Exploiting Modern Hardware for Frequent Itemset Mining: The k-Ary Predecessor Trie

DB Seminar: Wednesday June 16th, 2:30pm, DC 1302
Speaker: Vagelis Hristidis, Florida International University
Title: Information Discovery on Vertical Domains

DB Meeting: Wednesday June 23rd, 2:30pm, DC 1331
Speakers: Gunes Aluc, Ashraf Aboulnaga, Iman Elghandour, Shahab Kamali, Patrick Kling, Jeff Pound, Ken Salem, Frank Tompa.
Title: SIGMOD Five Minute Madness

DB Meeting: Wednesday June 30, 2:30pm, DC 1331
Speaker: Yingying Tao
Title: Detecting distribution changes in multi-dimensional data streams
Abstract: The unboundedness and high arrival rates of data streams and the dynamic variations in their underlying data distribution makes processing stream data challenging. A number of data stream change detection techniques have been proposed. However, most of them are ad-hoc and only works for streams with single dimensions. We propose a new technique based on control charts that can detect distribution changes in generic multi-dimensional data streams. Our approach focuses on the changes in two statistics of a distribution - mean and standard deviation - without making any assumptions about the stream or requiring prior knowledge of stream characteristics. This technique not only can detect the changes, but also can interpret them by analyzing the out-of-control signals in the control chart.

DB Meeting: Wednesday July 14, 2:30pm, DC 1331
Speaker: James Cheng
Title: Graph Data Management
Abstract: This talk will be based on two SIGMOD 2010 papers:

DB Meeting: Wednesday July 21, 2:30pm, DC 1331
Speaker: Yufei Tao
Title: Nearest Neighbor Search in High Dimensional Space
Abstract: Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. From the database perspective, a good solution needs to have two properties: (i) it can be easily incorporated in a relational database, and (ii) its query cost should increase sub-linearly with the dataset size, regardless of the data and query distributions. Locality sensitive hashing (LSH) is a well-known methodology fulfilling both requirements, but its current implementations either incur expensive space and query cost, or abandon its theoretical guarantee on the quality of query results.

In this talk, we will discuss the locality sensitive B-tree (LSB-tree) designed for fast, accurate, high-dimensional NN search in relational databases. The combination of several LSB-trees forms a LSB-forest that has strong quality guarantees, but improves dramatically the efficiency of the previous LSH implementation having the same guarantees. In practice, the LSB-tree itself is also an effective index, which consumes linear space, supports efficient updates, and provides accurate query results. In our experiments, the LSB-tree was faster than (i) iDistance (a famous technique for exact NN search) by two orders of magnitude, and (ii) MedRank (a recent approximate method with non-trivial quality guarantees) by one order of magnitude, and meanwhile returned much better results.

DB Meeting: Wednesday July 28, 2:30pm, DC 1331
Speaker: Shahab Kamali
Title: A new mathematics retrieval system
Abstract: The Web contains a large collection of documents with mathematical expressions. Currently, this mathematical content cannot be effectively queried and searched. Because mathematical expressions are objects with complex structures and rather few distinct symbols, conventional text retrieval systems are not very successful in mathematics retrieval. The lack of a definition for similarity between mathematical expressions, and the inadequacy of searching for exact matches only, makes the problem of mathematics retrieval even harder.

In this talk with an emphasis on the query language, and the indexing scheme, I will introduce a new mathematics retrieval system that addresses the above problems.

MMath Thesis Seminar: Wednesday Aug 18, 2:30pm, DC 1331
Speaker: Prashant Gaharwar
Title: Dynamic Storage Provisioning with SLO Guarantees

MMath Thesis Seminar: Wednesday Aug 25, 1:00pm, DC 1316
Speaker: Anusha Mallampalli
Title: Achieving Performance Objectives for Database Workloads

This page is maintained by Ken Salem.

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