CP363 DATABASE I, WINTER 2019, WLU

Course Description

The course provides an introduction to the basic features of Database Management Systems (DBMS), focusing on Relational Database Management Systems (RDBMSs). Students will obtain an understanding of how the different components of a DBMS system fit together. They will write programs to interact with a particular DBMS as a case study.

Prerequisites CP264 or permission of the Depatment

Course Staff

Instructor: Dr. Ilias S. Kotsireas,
Office: N2076A, Office Hours: 24/7 and by appointment, Phone: 884-0710 ext. 2218, E-Mail: ikotsireATwlu.ca
Assistant: Mr. David Brown,
responsible for the course assignments, E-Mail: dbrownATwlu.ca

Course Textbook

Fundamentals of Database Systems, 7/E Ramez Elmasri, Shamkant B. Navathe ISBN-10: 0133970779 ISBN-13: 9780133970777

Textbook Support Web Site: Pearson Education

Lecture Topics (corresponding to the 12 weeks schedule)

Introduction, Database System Concepts and Architecture
- Data Models
- Schemas
- Instances
- Data Independence
- Database Languages
CH1, CH2
Entity/Relationship (ER) Model
- Entity Types
- Entity Sets
- Attributes
- Keys
- Relationship Types
- Relationship Sets
- Roles
- Structural Constraints
- Weak Enity Types
- ER Diagrams
- Naming Conventions
- Binary/Ternary Relationships
CH3
Relational Data Model, Relational Databases, Examples of Relational Database Management Systems (RDBMS)
- Relational Constraints
- Relational Database Schemas
- Update Operations
CH5
Structured Query Language (SQL) Part I
- Data Definition, Data Types
- Constraint Specification
- Basic Queries, SELECT/FROM/WHERE, Ambiguities/Aliasing, Tuple Variables, Distinct, ORDER BY
- Set-theoretic UNION/EXCEPT/INTERSECT
- Substring Pattern Matching, Arithmetic Operators
- Null Values, IS, IS NOT
- Nested Queries, Correlated Nested Queries, EXISTS, NOT EXISTS
- Explicit Sets of Values, Attribute Renaming
- Joined Tables, Outer Joins
- Aggregate Functions, MAX, MIN, AVG, SUM, COUNT
- Grouping, GROUP BY, HAVING clauses
- INSERT/DELETE/UPDATE
- CREATE ASSERTION, Triggers
CH6
Structured Query Language (SQL) Part II
- Views (virtual Tables)
- Additional SQL examples on diferrent relational database schemas
CH7
Relational Algebra (RA)
- Select/Project (Unary) RA operators
- Set-theoretic RA operators
- Join/Division (Binary) RA operators
- Aggregate Functions and Grouping
- Outer Join
CH8
ER-to-Relational Mapping, EER-to-Relational Mapping
CH9
Functional Dependencies (FDs), Normal Forms (NFs), Normalization
- Redundancy, Update Anomalies, Spurious Tuples
- Definition of an FD, Inference Rules for FDs
- Equivalent Sets of FDs, Minimal Sets of FDs
- First NF, Second NF, Third NF, 2NF/3NF Normalization
- BCNF, BCNF Normalization
CH14
Algorithms for Relational Database Scheme Design, Multivalued and Join Dependencies
- Relational Decompositions
- Attribute Preservation, Dependency Preservation
- Nonadditive Join (Lossless Join)
- NULL Values, Dangling Tuples
- Multivalued Dependencies, Fourth NF
- Join Dependencies, Fifth NF
CH15
Query Processing and Optimization
- Translating SQL Queries into Relational Algebra
- Algorithms for SELECT Operation
- Query Trees and Heuristics for Query Optimization
- General Transformation Rules for Relational Algebra Operations
- Outline of a Heuristic Algebraic Optimization Algorithm
- Cost-based query optimization
CH18, CH19
Transactions, Schedules
- The Lost Update Problem, The Temporary Update Problem, The Incorrect Summary Problem
- Transactions States (BEGIN/END/COMMIT/ROLLBACK/ABORT), System Log
- ACID properties (Atomicity, Consistency preservation, Isolation, Durability/Permanency)
- operations in conflict (in a schedule)
- complete schedules, recoverable schedules, cascading rollback, cascadeless schedules
- Schedule Serializability, serial schedules, nonserial schedules, conflict-serializable schedules
CH20

Class Schedule and Winter Semester Timetable

              |     Mon     |     Wed     |    Fri      |
              |  9:30-10:20 |  9:30-10:20 |  9:30-10:20 |
              |    BA102    |    BA102    |   BA102     |
______________|_____________|_____________|_____________|_____
              |             |             |             |
Week 1:       |  Jan 07     |    Jan 09   |   Jan 11    |
Week 2:       |  Jan 14     |    Jan 16   |   Jan 18    |
Week 3:       |  Jan 21     |    Jan 23   |   Jan 25 A1 |
Week 4:       |  Jan 28     |    Jan 30   |   Feb 01    |
Week 5:       |  Feb 04     |    Feb 06   |   Feb 08    |
Week 6:       |  Feb 11     |    Feb 13   |   Feb 15 T1 |
______________|_____________|_____________|_____________|______
              |
Reading Week  |   Feb 18 - Feb 22   N o   C o u r s e s
______________|_____________________________________________

Week 7:       |  Feb 25     |   Feb 27    |   Mar 01    |
Week 8:       |  Mar 04     |   Mar 06    |   Mar 08    |
Week 9:       |  Mar 11     |   Mar 13    |   Mar 15 A2 |
Week 10:      |  Mar 18     |   Mar 20    |   Mar 22    |
Week 11:      |  Mar 25     |   Mar 27    |   Mar 29    |
Week 12:      |  Apr 01     |   Apr 03    |   Apr 05 T2 |
______________|_____________|_____________|_____________|______
              |             |             |             |

Course Requirements and Student Evaluation

Assignment 1: 10%, https://bohr.wlu.ca/ikotsireas/cp363/
Assignment 2: 10%, https://bohr.wlu.ca/ikotsireas/cp363/
Assignment 3: 10%, https://bohr.wlu.ca/ikotsireas/cp363/
Assignment 4: 10%, https://bohr.wlu.ca/ikotsireas/cp363/
Assignment 5: 10%, https://bohr.wlu.ca/ikotsireas/cp363/
Midterm Test 1: 25%, Feb 15, (in class)
Midterm Test 2: 25%, Apr 05, (in class)
Strict adherence to the assignments submission instructions is required
Late assignment submissions will not be accepted (unless valid medical documentation is provided) and will be marked with 0.

University and Course Policies (senate approved)

Special Needs: Students with disabilities or special needs are advised to contact Laurier’s Accessible Learning Centre for information regarding its services and resources. Students are encouraged to review the Academic Calendar for information regarding all services available on campus.
Plagiarism: Wilfrid Laurier University uses software that can check for plagiarism. If requested to do so by the instructor, students are required to submit their written work in electronic form and have it checked for plagiarism.
Academic Integrity: Laurier is committed to a culture of integrity within and beyond the classroom. This culture values trustworthiness (i.e., honesty, integrity, reliability), fairness, caring, respect, responsibility and citizenship. Together, we have a shared responsibility to uphold this culture in our academic and nonacademic behaviour. The University has a defined policy with respect to academic misconduct. As a Laurier student you are responsible for familiarizing yourself with this policy and the accompanying penalty guidelines, some of which may appear on your transcript if there is a finding of misconduct. The relevant policy can be found at Laurier's academic integrity website along with resources to educate and support you in upholding a culture of integrity. Ignorance is not a defense.
Classroom Use of Electronic Devices: Read WLU policy 9.3 Classroom Use of Electronic Devices.
Late Assignment Policy: late assignments will be marked with 0.
Final Examinations: Students are strongly urged not to make any commitments (i.e., vacation) during the examination period. Students are required to be available for examinations during the examination periods of all terms in which they register. Refer to the Handbook on Undergraduate Course Management for more information.
Foot Patrol, the Wellness Centre, Student Food Bank.