Fall 2009

Class Time and Place: Tu/Th 12:30-1:50 pm (WH 221)

Instructor: Dr. Gautam Das

Office: Nedderman Hall, Room# 302
Phone: 817 272 7595
Email: gdas@uta.edu

Office Hours:  Wed 1:00-2:00 pm and Thu 2:00-3:00 pm

Office: GeoScience Building, Room# 237
Email: ning.yan@mavs.uta.edu

Office Hours:  Thu 3:00-5:00 pm and by appointment

About the Course

Much of the world’s recorded data is locked up in structured sources such as databases, which are often the propriety information of private corporations and government agencies. Searching and exploring for information within databases is currently very cumbersome - often the data explorer has to know comprehensive query languages (such as SQL), as well as important information on how the data is structured into different tables and columns (the database schema). In recent years, researchers have pondered on the problems of improving the search and exploration capabilities for relational databases. This includes adapting probabilistic and approximate querying methods to improve the scalability of query answering, as well as information retrieval techniques such as relevance ranking and keyword search. This class will explore the recent efforts by researchers in these extremely important and challenging fields. We will read and discuss latest research literature gleaned from premier conferences in databases and information retrieval. It is hoped that this class will spur students to pursuing further research in these areas.

The following is a tentative list of topics which we will attempt to cover:

1. Probabilistic Methods in Databases

            Sampling Methods in Databases: Basics

            Approximate Query Processing

            Processing of Fuzzy/Uncertain Data

2. Unstructured Search in Databases Keyword Queries in Databases

            Ranking of Database Query Results 

3. DB and IR integration

            Top-K algorithms

We will cover various topics in breadth, understand the central contributions of these efforts and try and predict future research directions.

Prerequisites
Advanced Algorithms and Database II are the prerequisite courses. However, exceptions will be made on a case by case basis, especially if the student has prior exposure or demonstrates initiative to quickly learn these concepts on his/her own.

Presentations

The actual reading list, consisting of recent research papers, will be selected and finalized as the course progresses. Each student will present one or more papers (depending on the enrollment) during the semester. Students will participate in class discussions during and after each presentation. Attendance is required.

Homework

There is going to be two homework which are used for students to prepare for the exams.

Evaluation

The grade will be based on the paper presentations, class attendance and participation, performance in the projects, one midterm exam and one final exam.

Tentative Schedule (Presentation, Lectures and Exams)

Each paper will be presented by a group of two/three students based on the enrollment. Each group will present two papers. The papers will be presented in two cycles, the first one before the mid term exam and the second one after the midterm exam. Given below is a tentative schedule for class presentations over the course of this semester.

Announcements

• Please check this section regularly during the semester for updates and announcements on the course

• Ethics statement is available here. Please print, sign and submit it to the instructor during class.

• Group assignment for presentation might change in future. Any changes will be updated on the website.

• Please send the TA your presentation slides one day before the scheduled presentation.

• If you do not send you presentation slides before the scheduled presentation, you might loose some points.