CIS 670: Introduction to Database Systems           Winter 2001, 11:30-12:45 Section
(http://www.cis.ohio-state.edu/~srini/670)

Description:

Introduction to the use of database systems; use of query languages - SQL and relational algebra; conceptual and logical database design; entity-relationship model, relational database normalization; introduction to transaction processing.

Level and Credits: UG 3

Prerequisites: 570 and Ma 366; or graduate standing

Meeting Times: TTH 11:30-12:45, DL369

Instructor: S.Parthasarathy, DL 693, srini@cis.ohio-state.edu
Instructor's Office Hours: T 10:30-11:25, TH 10:30-11:25 and by appointment.

Grader: Do-Hyung Kim (kim.983@osu.edu)
Grader's Office Hours: MW 11:30-12:30, DL 172 (graders' room)

General Information, Exclusions, etc.

Objectives:

Text:


Approximate Sylabus:

Number of Weeks Topics Readings
3 Relational Model, Languages and Systems
  Introduction to Database Systems
  Relational Data Model and Relational Algebra
    Relational Data Model
    Relational Algebra
  SQL
     Data Definitions
     Queries and Updates
     Views
     Summary
     Introduction to Sybase
     Introduction to report writer
  Relational Calculus
EN: 1 & 2

EN: 7.1-7.3
EN: 7.4-7.7

EN: 8.1
EN: 8.2-8.4
EN: 8.5
EN: 8.8
Course Notes
Course Notes
EN: 9.3-9.5
2.5 Database Design: The Entity-Relationship Model
  Overview of the DB Design Process
  The Entity-Relationship (ER) Model
     The Model
     The Enhanced-ER Model Including UML Class Diagrams
     Mapping the ER Model to the Relational Model

skim EN: 16.1-2

EN: 3
EN: 4
EN: 9.1-9.2
2.5 Database Design: Functional Dependencies and Normalization
   Functional Dependencies and Normalization
     Functional Dependencies
     Normalization
   Normalization Algorithms
   Multivalued Dependencies and 4th Normal Form
  The Database Design Process


EN: 14.1-2
EN: 14.3-14.6
EN: 15.1
EN: 15.2
EN: 16.1-4, 16.6
2 Record at a Time Processing and Transaction Management
   Introduction
   Cursor Operations
   Call-Level Interface
   Transaction Processing
   Basic Locking/Concurrency Concepts   



EN: 19, 20.1

Grading Plan (G: graduate students; UG: Undergraduate students)

Homework. Late homeworks will not be accepted. There will be several written assignments and one project (based on the tutorials). 30%(UG) 15%(G)
Research Paper (Graduate Students only) Abstracts Due Jan 30 2001. Full papers due on March 1. 15%(G)
Midterm Exam: Tentative date: Feb. 6 in class 30%
Final Exam: TBA.
40%

Homework Assignments: (solutions to the more difficult problems are linked)

Transparencies (to be added during the quarter):
Lecture 1 (Jan/2)
Lecture 2 (Jan/4, Jan/9)
Lecture 3 (Jan/9) (slightly modified Jan/11)
Lecture 4 (Jan/11) It seemed (both in class and from some emailed questions) that people had trouble understanding the last example we discussed in class. Here are some additional notes on the last example (forall w count).
Lecture 5 (Jan/16). A short note on using forall in Tuple Relational Calculus.
Lecture 6 (Jan/18)
Lecture 7 (Jan/23)
Lecture 8 (Jan/25)
Lecture 9 (Jan/30)
Midterm (Feb/6) Solutions
Lecture 10 (Feb/8)
Lecture 11 (Feb/13)
Lecture 12 (Feb/15)
Lecture 13 (Feb/20)
Lecture 14 (Feb/22)
Lecture 15 (Feb/27)
No Class (Mar/1)
Graduating Senior/Masters Final Exam, Monday March 5th, 3:30 PM
The final will mostly cover what was covered in class since the midterm.
A small percentage (less than 20% of the total points)
of questions may appear from the first half of the course.
Again, like the midterm, you are permitted to bring one A-4 size sheet of paper with formulae.
Review (Mar/6)
Review (Mar/8)

Acknowledgments: The transparencies from the first four lectures are adapted from Doug Kerr's lecture notes. Mistakes are solely mine.

Tutorials


S. Parthasarathy
January 30, 2000.