| Instructor | Prof. Don Batory | batory@cs.utexas.edu |
| TA | TBA | |
| Office Hours | Batory | By Appointment |
| TBA | TBA | |
| Room | Burdine 220 | |
| Time | Tuesday, Thursday 2-3:30PM | |
| Unique# | 55835 | |
| Ground Rules | Rules of Conduct and Academic Honesty | |
| Your Grades | EGradeBook | |
| Final |
Thursday, December 11, 9:00–12:00 noon | |
Quick Links: Presentations, Programming Project, Course Survey Results
Course Objectives |
This is a graduate-level introduction to the principles of database systems. We review and explain fundamental ideas and algorithms that are used in the construction of centralized DBMSs, distributed DBMSs, and database machines. Topics to be covered include: query processing and optimization, database machines, object-oriented databases, concurrency control and recovery. Recent directions in database research are also surveyed.
Course Prerequisites |
All students must have taken undergraduate database or its equivalent.
Lecture Notes, Texts, and Class Lectures |
Lecture notes for the course will be made available at the Texas Union Copy Center. (There is only one packet and it costs $21.05). Class lectures are supplemented by papers (available below). Students will be responsible for reading these papers. Remember the rule: DO NOT PRINT THESE PAPERS ON CS PRINTERS!
An excellent reference for concurrency control and recovery is by Bernstein, Hadzilacos, & Goodman, Concurrency Control and Recovery.
Additional postings on lecture notes, homework assignments, and software will be made available through this web page as they become available.
Presentations |
The last class periods of the semester are devoted to student group presentations. These presentations will survey recent results presented in major database conferences. Group lectures will be critiqued prior to the actual presentation to enhance quality and content. Topics for presentation can be chosen from any recent database conference, among them are:
Programming Projects and Homework |
You can choose one of two course projects listed below. All projects must involve groups of 2 people.
Berkeley DB Project. Berkeley
DB is a file management system written in Java. It can be used to store tuples
of a relation and records of an attribute index. You will need to parse
mini-SQL (a very small subset of SQL DDL and DML), you will build an inverted
file system (relation+set of indexes), and a relational storage system
(inverted file + join algorithms). Not part of this project, but could
be, is an optimizer. Groups of two are possible for this project, but it must
be made clear how the responsibility was divided.
Click here for a description of the
entire project and project due dates.
Special Project. Propose your own project, explaining why your background disqualifies you from the above projects. Again, your project must involve a group of two. Also, you will be expected to use your project as the basis for your presentation. That is, special projects must be presented at the end of class -- in lieu of literature presentations.
Project submission. To submit your project, execute on a CS Linux machine:
> turnin -submit TBA cs386d <file>
To check your submissions:
> turnin -list TBA cs386d
Evaluation |
Final grades will be determined approximately by the following scheme:
Homework grades will be used to help decide borderline cases for final grades.
Extenuating Circumstances |
If you have difficulty meeting the requirements of this course, fail to hand in an assignment, or miss an exam because of extenuating circumstances, please advise the instructor in writing (not email) at the earliest possible date so that your situation can be discussed. If you encounter an unexpected medical or family emergency or a random act of Nature that causes you to miss the due date for homework or miss a quiz or exam, you must present suitable documentation in writing (not email) to the instructor before special consideration will be given. A file of all written correspondence will be kept by the instructor and decisions regarding them will be made at the end of the semester.
Course Outline |
Numbers in [brackets] indicates the number of lecture on a topic. Copies of lecture notes are available at the Texas Union Copy Center, and the papers are available via the links below. Papers highlighted in yellow are subject for questions on exams. Homework assignments are indicated in orange.
Query Processing [6] |
Data Storage, Database Optimization, and XML [4] |
Midterm (in class, date TBA) |
Concurrency Control [7] |
Recovery [3] |
Current Trends in Database Research [4] |
Miscellaneous [2] |
Final Thursday, December 11, 9:00–12:00 noon, Room TBA |