CS 5200: Introduction to Database Management

Fall 2009

Instructor: Ken Baclawski

342 WVH                                                                  617-373-4631
College of Computer ScienceKen@Baclawski.com
Northeastern UniversityFax: 617-373-5121
Boston, MA 02115

Class meeting times and location: W 6:00-9:00PM, 050 Dodge Hall

Office hours and location: Tuesday and Wednesday 3:00-4:00PM in 342 WVH.

Fall office hours will begin on 9 September 2009 and end on 16 December 2009.

There will be no office hours on 27, 28 October and 11, 25 November.

Course Description

Required Textbook

Prerequisites

Grading

Class Schedule

Assignments

Academic Honesty and Integrity

Required Textbook

Database Management Systems
by Raghu Ramakrishnan, Johannes Gehrke
Pub. Date: August 2002
ISBN: 0072465638
Format: Hardcover, 1104pp
Publisher: McGraw-Hill Science/Engineering/Math
Edition Number: 3

Prerequisites

Grading

The course grade will be based on ten assignments (50%), a Mid-Term Exam (20%), and a Final Exam (30%). The exams will be open-book/open-notes exams. The Mid-Term Exam will be given on 14 October 2009 during the beginning of the regular class time. The exam will be followed by a lecture. There will be regular class on 11 November 2009 at the usual time and place even though this is a University Holiday. This is necessary to make up for the holidays during the term. The Final Exam will be given on 16 December 2009 during the regular class time.

Class Schedule

DateTopicReadingExamples
9/9Overview of Database Systems and Database Design Sections 1.1-1.9, 2.7, 2.1-2.5 and Introduction to UML Sample Exercise and Solution; Sample Exercise with Answers
9/16The Relational Model and Translating to the Relational Model Sections 3.1-3.4, 3.6-3.7 Sample Exercise, Solution Part 1 and Solution Part 2; Exercise 2 Part 1 and Exercise 2 Part 2; Exercise 3 and Solution; Exercise 4 with Answers
9/23The Relational Algebra and SQL Queries Sections 4.1-4.2 and 5.1-5.4 Sample Exercise and Solution; Exercise 2 and Solution; Exercise 3 and Solution
9/30Advanced SQL and Introduction to Database Application Development Sections 5.5-5.7 and 6.1-6.3 Sample Exercise and Solution
10/7Stored Procedures and Overview of Storage and Indexing Sections 6.5 and 8.1-8.5 Exercise and Solution
10/14Mid-Term Exam and Overview of Query Evaluation Sections 12.1-12.5 Exercise and Solution
10/21Query Optimization, Transaction Management and Concurrency Control Sections 12.6, 16.1-16.6 and 17.1-17.4 Exercise with Answers
11/4Specialized Concurrency Control and Normalization Sections 17.5-17.6 and 19.1-19.6 Sample Exercise and Solution; Exercise 2 and Solution
11/11Database Tuning Techniques Sections 20.1-20.10 Sample Exercise and Solution; Exercise and Solution
11/18Security and Object-Relational Databases Sections 21.1-21.4 and 23.1-23.7
12/2Database Implementation Challenges and Text Databases Sections 23.8 and 27.1-27.3
12/9XML and Spatial Databases Sections 27.5-27.8 and 28.1-28.7

Assignments

There will be 10 assignments.

  1. The first assignment is due on Tuesday 15 September 2009 at 11:00pm.
  2. The second assignment is due on Tuesday 22 September 2009 at 11:00pm.
  3. The third assignment is due on Tuesday 29 September 2009 at 11:00pm. See solution for solutions to the queries.
  4. The fourth assignment is due on Tuesday 6 October 2009 at 11:00pm.
  5. The fifth assignment is due on Tuesday 20 October 2009 at 11:00pm.
  6. The sixth assignment is due on Tuesday 27 October 2009 at 11:00pm.
  7. The seventh assignment is due on Tuesday 10 November 2009 at 11:00pm.
  8. the eighth assignment is due on Tuesday 17 November 2009 at 11:00pm.
  9. the ninth assignment is due on Tuesday 1 December 2009 at 11:00pm.
Please mail your solution to the grader, Sumit Purohit at sumitp@ccs.neu.edu. In your mail to the grader, please specify "CS 5200" as the mail subject, and the name of the file (or zip file) that you attach should have the name "<your name>_<assignment number>". In other words, the name of the file should specify your name and the assignment number.