CISC 432*/832*

Advanced Database Management Systems

Fall 2003

[Announcements | General Information | Text Books]

[Computing Resources | Course Content | Marking Scheme | Assignments]

The course follows from CISC 332 and examines DBMSs from a systems-oriented viewpoint. The course introduces students to fundamental algorithms and concepts used to implement DBMSs. The main topic areas covered in the course include storage structures and management, query processing and optimization, concurrency control, recovery, security and physical database tuning. Assignments are a mixture of written questions and programming.

Announcements

General Information

Instructor:

Pat Martin
Goodwin Hall 630
533-6063
martin@cs.queensu.ca

Schedule:

Slot 12
Dupuis 215

TAs:

Hao Yu
(yuh@cs.queensu.ca)
Office Hours: Tuesday 2:30 – 4:30
Lei Wu
(wul@cs.queensu.ca)
Office Hours: Tuesday 11:00 – 12:00 and
                      Thursday 2:30 – 3:30
Jared Zebedee
(zebedee@cs.queensu.ca)
Office Hours: Monday 11:30 – 12:30
                     Wednesday 12:30 – 1:30

Prerequisites:

CISC 332* or permission of the instructor.

Text Book

Database Management Systems (3rd Edition), Raghu Ramakrishnan and Johannes Gehrke, McGraw-Hill Higher Education.

Computing Resources

Programming assignments may involve DB2 Universal Database and/or Java. Assignments should run on the machines in the undergraduate CAS laboratories in Goodwin Hall and Walter Light Hall.

Course Content

The course material is organized into the following units:

·        Unit 1 - DBMS storage and indexing

·        Unit 2 - Query evaluation and optimization

·        Unit 3 - Transaction management

·        Unit 4 – Supplemental lectures

A tentative course schedule is available. Lecture slides are available in PDF format from the unit web pages. They can be read using Adobe Acrobat reader.

Marking Scheme

Undergraduate Students

Graduate Students

The mark is converted to an equivalent mark out of 100.

Assignments

Assignment 1 – Advanced database systems and applications paper. Worth 15 marks. Due October 2, 2003.

Assignment 2 – Query processing and evaluation. Worth 10 marks. Due October 29, 2003.

Assignment 3 – Query optimization. Worth 10 marks. Due November 13, 2003. Sample solution.

Assignment 4 – Transaction management. Worth 10 marks. Due November 26, 2003. Sample solution.

 

Survey paper.

 

Group project.

 

NOTE:

  1. A hard copy of assigned work is to be handed at the beginning of class on the date due. Do not hand-in assignments via email.
  2. Late assignments are subject to a 10% per day late penalty, with weekends counted as one day. Late assignments will not be accepted beyond 5 days past the date due.
  3. A list of all updated marks will be posted after each piece of work is returned. Be sure to check your marks and to report any problems to the professor.
  4. Students must send an email to the professor declaring their choice(s) of final exam, project or paper by September 30, 2003.

Plagiarism

Plagiarism is defined in the Arts and Science calendar as the act of  “presenting work done (in whole or in part) by someone else as if it were one’s own”. Plagiarism is different from cooperation or collaboration. Students may, where explicitly permitted, work in groups and present results collectively. Examples of plagiarism include

·        Submitting a paper or assignment prepared in whole or in part by someone else as one’s own.

·        Copying a paper or assignment or knowingly allowing someone else to copy your paper or assignment.

·        Using direct quotations or large sections of paraphrased materials without acknowledgement.

·        Submitting the same piece of work in more than one course without the permission of the instructors.

·        Taking large sections of papers found on the Web and submitting as part of your own work.

The minimum penalty for plagiarism will be a mark of zero for the specific piece of work where plagiarism occurred. A more severe penalty may be assessed when it is warranted by the situation.

[CISC Home Page]

School of Computing, Queen's University

All contents copyright (c) 2003, Patrick Martin.
All rights reserved.