Introduction
to Database Management Systems (CS470)
Class meets on Mondays and Wednesdays at 2:00 to 3:15 PM in Room: FH 338.
Ph: 235 2366. Room: Office Hrs: 12:30-1:30PM on MW (Office: RFH 550J).
Text Book: Fundamentals of Database Systems (Fourth Edition). Elmasri/Navathe. AW.
Prerequisites: CS352. Every student must have completed this prerequisite (or equivalent at any other university) with a grade of C or higher. Without clearing prerequisite, no student is allowed in this course.
Lecture
notes: Lecture notes are on the web (http://www.sice.umkc.edu/~kumar).
Click on "Teaching".
This is an introductory theoretical course on database systems. The aim of this course is to introduce basic concepts of large scale database and database management systems. At the end of this course it is expected that students will have a reasonably good idea about file organizations, relational data model, relational algebra, relational calculus, database processing, transaction management, database recovery, etc. These are fun topics and are easier to grasp with a well-planned approach. Here are some useful points you should remember to improve your understanding and performance in the course. In this course query languages such as SQL, PL/SQL, etc. and database design, implementation, validation, etc., which are the topics of CS471, will not be covered. However, a brief introduction will be presented. Please note that self reading of a number of sections of the book is highly recommended. These sections are as essential as sections which will be covered in the lecture and they will be included in the tests.
We will discuss test material in the class a week in advance. These questions are from the class discussion we have, so participate in the discussion and express your ideas, questions, suggestions, etc.
The entire course will be managed using the test book and lecture notes on the web.
A tentative timetable
I will try to cover these topics in the order they are listed. However, in some situations it may be necessary to rearrange their order.
|
Chapters |
Contents |
|
1 |
All sections |
|
2 & 3 |
All sections. |
|
5 & 6 |
All sections. Relational data model, Relational Algebra and Tuple Relational Calculus will be covered in detail. |
|
8 & 9 |
Selective topics only. SQL and SQL queries will be covered briefly. |
|
10 & 11 |
All sections. Database design, schema, Functional Dependencies, Normal forms, etc. |
|
13 & 14 |
All sections. File organizations and trees. Some topics will be identified for self study such as family of B-trees because they are heavily based on CS352 material. |
|
15 |
Query processing and optimization. All sections. |
|
17 |
All sections. Transaction processing Concepts. This lecture will be mainly based on lecture notes available on the web. |
|
18 |
All sections. Concurrency Control Techniques. This lecture will be mainly based on lecture notes available on the web. |
|
19 |
All sections. Database Recovery. This lecture will be mainly based on lecture notes available on the web. |
|
23 |
If time permits we will discuss Database security and World Wide Web. |
Tests and Homeworks
There will be three to four homework and three tests. We will have 2 or 3 group discussions for extra points. Homework will be related to the topics covered in the class. All tests are closed book and closed notes.
Total Points: 100. This will be divided among homework and tests as follows:
Group discussions: 10. This assignment is for extra points. The date of discussions will be announced in the class.
Homework: 20. Test 1: 20. Test 2: 24. Test 3 (Final): 36.
Grading Range: A: 95 – 100 A-: 90 – 94
B+: 84 – 89 B: 70 – 83 B-: 65 – 69
C: 55 – 64 D: 45 - 54
Grading of Homework: Each homework will be graded out of 20 points. At the end the final homework score will be computed by taking the average of all homework scores. Thus, the final homework score = (HW1 score + HW2 score + HW3 score + HW4 score) ÷ 4. Every effort will be made to eliminate the conflict between homework submission dates and test dates, however, in some cases it may not be possible to do so. Test material will be discussed one week before the test.
|
Test 1 (2:00 to 3:15 PM) |
Test 2 (2:00 to 3:15 PM) |
Final (8:00 to 10:00 AM) |
|
Wednesday, September 19, 2007. |
Wednesday, October 25, 2007. |
Thursday, Dec. 13, 2007 (To be discussed) |
Some Important Points to Remember
You are expected to know and observe the particulars of this handout. I follow them rigorously. Ignorance of their contents WON'T excuse you from the consequences of not following the directives they contain.
· Special cases handling policy: It is important that every student must work on homeworks individually unless stated otherwise, and they must turn them in on time. Failure to submit TWO or more homeworks will earn an F irrespective of your performance in tests and other homeworks. If, however, there is a substantiated sufficient reason (the obstacle must be something out of the ordinary and beyond your reasonable control such as serious illness or something comparable, extended computer breakdown, etc.) for the tardiness, there will be no penalty provided the homework is turned in at a time agreed upon by you and me. YOU MUST INITIATE any discussion in this direction. Hearing nothing I will presume that there is no sufficient excuse and act accordingly. Two or more identical programs will not be accepted and involved students will receive an F (irrespective of their grades in other homework and tests) as their final grade. It is to be remembered that identical programs means coding identical algorithms where variable names may or may not be the same.
· Every student must come in time. No latecomer will be allowed after the classroom door is closed. If you have a valid reason for coming late in the class, then I must have your request in writing stating the reason for not be able to come on time.
· Programming help in homework: I will not provide any programming (coding) help. However, I will be happy to discuss any programming problem.
· It is students’ responsibility to find out what was covered in the class during his/her absence. Such absence from the class will not be accepted as a reason for not submitting the homework on time or for obtaining a poor score in tests.
· Withdrawal: There is no academic assessment for withdrawal before or on Friday, October 12, 2007. After this date an academic assessment of " W" or "WF " will be made.
· Incomplete grade (I): Incomplete (I) grades will not be given for failing to complete the course work on time or obtaining poor scores in tests or homework. If there is a case for an incomplete grade, then the student must provide necessary document to the instructor for the approval.
· Change from Credit to Audit: The instructor is the only person that may authorize change in status from regular to audit. The last date for this change is Friday, September 14, 2007 and the student must have a grade of "C" or better. No requests to change to audit will be granted after this date.
· Last day of classes: December 7, 2007.