Alternatively, if you are behind the firewall, the following links should work: ACM digital library and IEEE digital library.
Teaching Assistant:
Unil Yun
Office: 408G H.R. Bright Bldg
Office Hours: Tuesdays and Fridays 12:30 - 2:00 PM
Email: yunei @ neo.tamu.edu
Office Phone: 845-4924
Peer Teacher:
Christopher Portales
Office: 219 H.R. Bright Bldg (Open Access Lab)
Office Hours: Mondays and Wednesdays 4:00 - 5:30, Tuesdays and Thursdays
8:00 - 9:30 and 3:45 - 5:30
Email: cportales @ tamu.edu
Office Phone: N/A
Course URL: http://faculty.cs.tamu.edu/welch/teaching/310.f05
Prerequisites: For CPSC 310, prerequisite is CPSC 211 (or 210); For CPSC 603, prerequisite is CPSC 601. In particular, you should be familiar with hash tables and search trees.
Lecture: Monday, Wednesday, Friday, 9:10-10:00 AM, CHEN 106.
Textbook: Database Systems, The Complete Book, Hector Garcia-Molina, Jeffrey D. Ullman, and Jennifer Widom, Prentice Hall, 2002.
| week of | topic | reading |
| 8/29 | Introduction; E/R Model | Chs 1, 2 |
| 9/5 | Relational Model | Ch 3 |
| 9/12 | Relational Algebra | Ch 5 |
| 9/19 | SQL | Ch 6 |
| 9/26 | Constraints and Triggers; System Aspects | Chs 7, 8 |
| 10/3 | Data Storage | Ch 11 |
| 10/10 | Representing Data Elements | Ch 12 |
| 10/17 | Index Structures | Ch 13 |
| 10/24 | Query Execution | Ch 15 |
| 10/31 | Query Compiler | Ch 16 |
| 11/7 | Coping with Failures | Ch 17 |
| 11/14, 11/21 | Concurrency Control | Ch 18 |
| 11/28, 12/5 | More on Transactions | Ch 19 |
Your grade will be based on four components:
No late assignments will be accepted. There will be no make-up exams except for university-excused absences. Please discuss unusual circumstances in advance with the instructor.
Course grades will be assigned according to this scale:
A for 90% or above of the total points,
B for 80 to 89%,
C for 70 to 79%,
D for 60 to 69%,
and F for less than 60%.
Academic Integrity: The Aggie Honor Code states "An Aggie does not lie, cheat or steal or tolerate those who do". More information on academic integrity, plagiarism, etc. is available at the Aggie Honor System Office web site http://www.tamu.edu/aggiehonor, including:
Americans with Disabilities Act (ADA) Policy Statement: The Americans with Disabilities Act (ADA) is a federal antidiscrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact the Department of Student Life, Services for Students with Disabilities in Cain Hall, Rm. B118, or call 845-1637.
| Monday | Tuesday | Wednesday | Thursday | Friday |
| 8/29 Introduction Read Ch 1 | 8/30 | 8/31 Entity-Relationship Model HW 1 due Read Ch 2 | 9/1 | 9/2 Relational Model Read Ch 3 |
| 9/5 Converting E/R Diagrams to Relations | 9/6 | 9/7 Functional Dependencies Project teams due HW 2 due | 9/8 | 9/9 Normalization |
| 9/12 Multivalued Dependencies Culture 1 due | 9/13 | 9/14 Normalization Examples Read Ch 5 HW 3 due | 9/15 | 9/16 Relational Algebra |
| 9/19 More Relational Algebra; Intro to SQL Project part 1 due | 9/20 | 9/21 More SQL Read Ch 6 HW 4 due | 9/22 | 9/23 NO CLASS |
| Monday | Tuesday | Wednesday | Thursday | Friday |
| 9/26 Summary of SQL Queries SQL Query Examples | 9/27 | 9/28 Modifying the DB with SQL HW 5 due | 9/29 | 9/30 Constraints and Triggers Read Ch 7 |
| 10/3 Views; Review Project part 2 due | 10/4 | 10/5 EXAM 1 | 10/6 | 10/7 Exam 1 Solutions Culture 2 due |
| 10/10 Combining SQL with Conventional Programming Languages; Transactions Read Ch 8 | 10/11 | 10/12 Data Storage Read Ch 11 HW 6 due | 10/13 | 10/14 Representing Data Elements Read Ch 12 |
| 10/17 Indexes on Sequential Files Read Ch 13 Project part 3 due | 10/18 | 10/19 Secondary Indexes; B-Trees HW 7 due | 10/20 | 10/21 More on B-Trees |
| Monday | Tuesday | Wednesday | Thursday | Friday |
| 10/24 Hash Table Indexes Indexing Exercises; Hashing Culture 3 due | 10/25 | 10/26 Hash Table Indexes HW 8 due | 10/27 | 10/28 Query Execution, One-Pass Algorithms Read Ch 15 thru sec 6 |
| 10/31 Query Execution, Two-Pass Algorithms Project part 4 due | 11/1 | 11/2 Query Execution, More Two-Pass Algorithms HW 9 due | 11/3 | 11/4 Query Compilation, Logical Query Plans Read Ch 16 |
| 11/7 Query Compilation, Evaluating Logical Query Plans | 11/8 | 11/9 Query Compilation, Physical Query Plans | 11/10 | 11/11 Review for Exam 2 HW 10 due |
| 11/14 Recovery: Undo and Redo Logging Read Ch 17 Culture 4 due | 11/15 | 11/16 EXAM 2 (definite) | 11/17 | 11/18 Exam 2 Solutions; Recovery: Undo/Redo Logging |
| Monday | Tuesday | Wednesday | Thursday | Friday |
| 11/21 Concurrency Control Read Ch 18.1-18.5 Project part 5 due | 11/22 | 11/23 More on Concurrency Control HW 11 due | 11/24 THANKSGIVING HOLIDAY | 11/25 THANKSGIVING HOLIDAY |
| 11/28 Still More on Concurrency Control | 11/29 | 11/30 Serializability and Recoverability Read Ch 19.1 and 19.3 | 12/1 | 12/2 Deadlock Detection and Prevention Culture 5 due HW 12 due |
| 12/5 ATTEND FRIDAY CLASSES Review Project part 6 due | 12/6 ATTEND THURSDAY CLASSES | 12/7 READING DAY | 12/8 READING DAY | 12/9 |
| 12/12 FINAL EXAM 8:00 - 10:00 AM | 12/13 | 12/14 | 12/15 | 12/16 |
User guides for students are available at http://www.gradiance.com/info.html
Before you can start doing your homework on Gradiance, you have to create an account:
You are to find, read, and write short reports on five technical papers in computer science journals. Articles in the following two journals are usually at about the right level:
Each report is to be one to two pages long, typed, and must include
DO NOT PLAGIARIZE! You must write up your summary in your own words. See academic integrity policy in the syllabus.
Report due dates are indicated in the calendar and are summarized here:
Here are some tips for getting full credit on your reports.
On occasion, a culture assignment may be substituted by attendance at and a report on a Distinguished Lecture. These opportunities will be announced as they arise.
Each report is to be one to two pages long, typed, and must include
Computing-Related at TAMU
Careers and Mentoring