Index of class resources

Assignments — homework and project assignments, homework solutions, other helpful handouts
General Class Information — class and section times, instructor and TA information, class overview

• Homework Assignments
  • Homework Assignment 1
  • Homework Assignment 2
• Project Assignments
  • Project Assignment 2
  • Project Assignment 3 -- Due on 5/23
  • Project Assignment 4 -- Due on 6/9
• Extra Credit
  • Project Assignment 1 -- Due on 6/9

Class FORUM:

CMPS 181 - for announcements, general discussion, and help

Lecture times:

TuTh, 10:00AM-11:45AM, Steven Acad. 175

Section times:

Mo, 09:00AM-11:00PM, Crwn Comp Lab 201

Tu, 04:00PM-06:00PM, Crwn Comp Lab 201

Th, 12:00PM-02:00PM, Crwn Comp Lab 201

Instructor:

Name: Neoklis Polyzotis (alkis@cs.ucsc.edu)

Phone: x9-1304

Office: E2#353

Instructor Office Hours:

Tu 01:00PM-03:00PM, or by appointment

Teaching Assistant:

Name: Guozheng Ge (guozheng@soe.ucsc.edu)

Office: BE314

Office Hours:

Th, 2:30-3:30PM

Textbook:

Database Management Systems (3rd Edition), R. Ramakrishnan and J. Gehrke, McGraw-Hill.

The course will cover chapters 8-15, plus selected topics from chapters 17, 20, 22, and 27 (as time permits).

Syllabus

Topic	Lectures
Introduction	1
Overview of relational databases and SQL	1-2
Disks and Files	2
File Organizations and Indexing	2
Tree-Structured Indexing: ISAM and B-Trees	2
Hash-based Indexing	1
Query Execution	1
External Sorting	1
Relational Operators	1-2
Query Optimization and Database Tuning	1-2
Concurrency Control	1
Distributed Databases	1-2
Information Retrieval	1
Data Warehousing	1

Grading

Homework Assignments:	10%
Lab Assignments:	40%
Midterm Examination:	20%
Final Examination:	30%

Exam Schedule

Midterm: Thursday, May 4, 10:00AM - 11:45 AM, Steven Acad. 175

Final: Wednesday, June 14, 12:00 - 3:00 P.M., Steven Acad. 175

 

Note: The exam dates are fixed and cannot be changed.

Term Project

The project component of CMPS181 involves 4 programming assignments on the following modules of a relational database system:

• Heap file
• Buffer manager
• B-tree index
• External sort operator

There will be a final project report that will present a benchmarking study of the implemented components.

The project will be based on the minibase relational system which is implemented in C++. Students will be provided with a working copy of minibase and will need to complete the implementation of the components specified in each assignment.

Academic Dishonesty Policy

No form of academic dishonesty will be tolerated. You are encouraged to read the campus' policies regarding academic integrity (http://www.ucsc.edu/academics/academic_integrity).

You are allowed to ask for help when working on homework and lab assignments, provided that you acknowledge, on the work that you turn in, the help that you received. Points will be deducted if it appears that labor has been divided among multiple students; otherwise, there will be no penalty for small amounts of acknowledged assistance.

If you have any questions about these rules, please discuss them with the instructor immediately.