CP363 DATABASE I, FALL 2025, 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.

Territorial Acknowledgement I acknowledge that in Kitchener, Waterloo, Cambridge, and Brantford we are on the traditional territory of the Neutral, Anishnawbe, and Haudenosaunee peoples.

Prerequisites C164 or permission of the Depatment

Course Staff

• Instructor: Ilias S. Kotsireas,
  Office: N2076A, Phone: 884-0710 ext. 2218, E-Mail: ikotsireATwlu.ca
• Assistant: David Brown,
  responsible for the course assignments, E-Mail: dbrownATwlu.ca

Office Hours

• Please e-mail me to book an individual appointment at my office or on skype/zoom.
• For authentication/security purposes, please include your Laurier Student ID, and your first and last name, in all communcations regarding the course.

Course Textbook

Fundamentals of Database Systems, 7/E Ramez Elmasri, Shamkant B. Navathe ISBN-10: 0133970779 ISBN-13: 9780133970777 e-textbook: $57.99 print/hardcover $246.00

Textbook Support Web Site: Pearson Education

Lecture Topics (corresponding to the 12 weeks schedule)

1. Introduction, Database System Concepts and Architecture
   • Data Models
   • Schemas
   • Instances
   • Data Independence
   • Database Languages
   CH1, CH2
   
   
2. 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
   
   
3. Relational Data Model, Relational Databases, Examples of Relational Database Management Systems (RDBMS)
   • Relational Constraints
   • Relational Database Schemas
   • Update Operations
   CH5
   
   
4. 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
   
   
5. Structured Query Language (SQL) Part II
   • Views (virtual Tables)
   • Additional SQL examples on diferrent relational database schemas
   CH7
   
   
6. Relational Algebra (RA)
   • Select/Project (Unary) RA operators
   • Set-theoretic RA operators
   • Join/Division (Binary) RA operators
   • Aggregate Functions and Grouping
   • Outer Join
   CH8
   
   
7. ER-to-Relational Mapping, EER-to-Relational Mapping
   CH9
   
   
8. 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
   
   
9. 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
   
   
10. 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
    
    
11. 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 Fall Semester Timetable

              |     Mon     |     Wed     |    Fri      |
              | 10:30-11:20 | 10:30-11:20 | 10:30-11:20 |
              |    N1002    |    N1002    |    N1002    |
______________|_____________|_____________}_____________|_
              |             |             |             |
Week 0:       |    ---      |     ---     |   Sep 05    |
Week 1:       |  Sep 08     |    Sep 10   |   Sep 12    |
Week 2:       |  Sep 15     |    Sep 17   |   Sep 19    |
Week 3:       |  Sep 22     |    Sep 24   |   Sep 26    |
Week 4:       |  Sep 29     |    Oct 01   |   Oct 03    |
Week 5:       |  Oct 06     |    Oct 08   |   Oct 10    |
______________|_____________|_____________|_____________|______
              |
Reading Week  |   Oct 13 - Oct 17   N o   C o u r s e s
______________|________________________________________________
              |             |             |             |
Week 6:       |  Oct 20     |   Oct 22    |   Oct 24    |
Week 7:       |  Oct 27 (M) |   Oct 29    |   Oct 31    |
Week 8:       |  Nov 03     |   Nov 05    |   Nov 07    |
Week 9:       |  Nov 10     |   Nov 12    |   Nov 14    |
Week 10:      |  Nov 17     |   Nov 19    |   Nov 21    |
Week 11:      |  Nov 24     |   Nov 26    |   Nov 28    |
Week 12:      |  Dec 01     |   Dec 03    |    ---      |
______________|_____________|_____________|_____________|______
              |             |             |             |

Course Requirements and Student Evaluation

• assignment schedule: https://bohr.wlu.ca/cp363/asgns/
  
• assignment statement: https://bohr.wlu.ca/cp363/ias/
  


• Assignment 1: 10%, Release Date: TBA
• Assignment 2: 10%, Release Date: TBA
• Assignment 3: 10%, Release Date: TBA
• Assignment 4: 10%, Release Date: TBA
• Assignment 5: 10%, Release Date: TBA
• Midterm Examination 25%, Mon Oct 27, (in class, on paper, closed book)
• Final Examination 25%, (date/location TBD)
• Strict adherence to the assignments submission instructions is required
• Late assignment submissions and/or resubmissions will not be accepted (unless valid medical documentation is provided) and will be marked with 0.

University and Course Policies (senate approved)

1. 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.
2. 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.
3. 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.
4. Classroom Use of Electronic Devices: Read WLU policy 9.3 Classroom Use of Electronic Devices.
5. Late Assignment Policy: late assignments will be marked with 0.
6. 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. The Final Examination will be scheduled by the Examinations Office of the University. I will provide you with date, time and location as soon as becomes available.
7. Foot Patrol, the Wellness Centre, Student Food Bank.