- June 2 - Some clarification about HW6. Question1 (a) and (b), smallest instance of R means a set of tuples, empty set allowed. Questions2 tries to compute all possible tuples from a source to a destination. For example, Flight table has two tuples (sfo, jfk, ua) and (jfk, la, ua), the result should contain those two tuples and other possible routes, in case this (sfo, la, ua). a, s, and d in the question are not specific names, they are just table attributes. If you have further questions about this, please go to the teacher's office hour tomorrow.
- June 1 - The teacher will have one extra office hour on Friday from 12:30 to 1:30pm. She will also give a review session in Thursday's class.
- May 27 - Since lab4 is closed, there will be NO more lab sessions. TA will have office hours from 2-6pm on next Wednesday. Please drop by BE354I if you have questions.
- May 27 - HW6 is out, here is the PDF file. It is due in class on June 3rd. No extension will be granted and please start early.
- May 26 - Definition for a *good* decomposition (exercise 19.10, pp.645). A good decomposition should satisfy 3 conditions: 1)lossless 2)dependency-preserving 3)being either BCNF or 3NF. You should answer if the decomposition is lossless, dependency-preserving, and if it is either BCNF or 3NF.
- May 24 - Lab4 gets 1 day extension and the new due time is Wednesday midnight.
- May 20 - HW 5 is out. Half of it is on OTC and the other half in a PDF file. It is due on May 27 (next Thursday).
Previous News and Announcements (April 6-May 19), Click Here
Introduction to the concepts, approaches, tools, and methodology of database design. Covers the entity-relationship model, the relational model, relational algebra, relational calculus, commercial languages (such as SQL and QBE), functional dependencies, normal forms, and design theory. Other topics may include knowledge-bases, constraint databases, and alternative database models.
Lecture Time and Location — Tue & Thur: 4-5:45pm @ Classroom Unit 1.
Instructor — Wang-Chiew Tan (wctan@cs.ucsc.edu) Office Hour (Mon: 3-4pm and Thur: 11-12am @ BE359A)
Teaching Assistant — Guozheng Ge (guozheng@cs.ucsc.edu) Office Hour (Wed: 2-4pm @ BE354I)
Textbook — Database Management Systems (3rd Edition) by Ramakrishnan and Gehrke, McGraw Hill 2003
Lab and Discussion Sections — Wed 4:30-6:30pm & Fri 10-12am @ Ming Ong Computer Lab 108
Newsgroup — ucsc.class.cmps180 (use your favoriate clients like Outlook Newsreader or ThunderBird, the NNTP server is news.ucsc.edu.
Syllabus (pdf) — important information about the class, e.g. class schedule, lecturer and TA's contact, office hours, lab session time and location, etc.
Topic |
Number of Lectures |
| Introduction and Basic Concepts |
1 |
| Entity-Relationship Model |
1 |
| The Relational Data Model |
1 |
| SQL: Queries, Constraints, and Triggers |
4 |
| Relational Algebra and Calculus |
4-5 |
| Schema Refinement and Normal Forms |
4-5 |
| Database Application Development |
1 |
| Deductive Databases and Datalog |
1-2 |
| Overview of Query Evaluation |
1-2 |
| Midterm |
1 |
- History, Overview [ Chapter 1 ]
- The Relational Data Model: database schema, relation schema, instances, key/foriegn key [ Chapter 3.1, 3.2]
- Basic SQL, Expressions and Strings in the SELECT command
- Join, NATURAL JOIN, UNION, INTERSECT, EXCEPT [ Chapter 5.1, 5.2, 5.3 ]
- Nested Queries, Correlated Nested Queries, Set-Comparison Operators [ Chapter 5.4 ]
- Aggregates, GROUP BY, HAVING, VIEWS [ Chapter 5.5, 3.6, 3.7 ]
- Null Values, Logical Connectives, EXISTS, ALL, Outer Joins Complex
Integrity Constraints in SQL [ Chapter 5.6, 5.7 ]
- Relational Algebra: Prelimnaries, Select, Project, Set Operations,
Renaming, Joins, Division [ Chapter 4.1, 4.2 ]
- Relational Calculus: First-order Logic, TRC, DRC
[ Chapter 4.3 ]
- More examples of Relational Algebra and Relational Calculus,
Expressive Power of Algebra and Calculus
[ Chapter 4.4 ]
- Schema Refinement: Introduction, functional dependencies
[ Chapter 19.1, 19.2 ]
- Reasoning about FDs: Closure, attribute closure
[ Chapter 19.3 ]
- Normal Forms: BCNF, 3NF, Properties of Decomposition
[ Chapter 19.4, 19.5, 19.6 ]
- Datalog: A logical query language
[ Chapter 24.1 to 24.2 ]
Homeworks:
please read "Directions for Using Gradience Online Testing Center"
Lab Assignments (15 points):
please read the lab_policy
|
Quantity |
Date & Time |
Percentage |
| Quiz |
2 |
April 15, 4-4:30pm
May 20, 4-4:30pm |
10% |
| Midterm |
1 |
April 29, 4-5:45pm |
30% |
| Final |
1 |
June 7, 4-7pm |
30% |
| Homeworks |
6 |
|
15% |
| Lab Assignments |
4 |
|
15% |
No form of academic dishonesty will be tolerated. You are encouraged to read the campus' policies regarding 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.
-
|
