logo
 
Syllabus
CS 6890 - Web-based Database Management Systems
Utah State University
Home
Lectures
Homework   
Syllabus
Resources
People

Course Location

1:30-2:20 MWF Old Main 115
http://www.cs.usu.edu/~cdyreson/teaching/databases/081

Teacher Contact Details

Assistant Professor Curtis Dyreson
Office: Main 402A
Phone number: 797-0742
E-mail: Curtis.Dyreson at usu dot edu
Office Hours: Wed 9:00-11:00 or by appt. via e-mail

Course Background

This course is an advanced study of
  • non-relational data models,
  • the internals of a database management system,
  • and database frontiers.

Course Objectives

This course will help students to achieve the following objectives.
  • Learn new ways to model data.
  • Implement a DBMS.
  • Become familiar with the expanding role of database technology.

Text

Korth and Silbershatz.

Additional Reading

Other papers will be either handed out in class.

Course Prerequisites

The course prerequisite is CS4800/5800, or permission from the instructor. If you do not meet these prerequisites, you MUST come and talk with the teacher in the first week of class. The teacher reserves the right to drop you from the course if it becomes obvious that you do not meet the prerequisites.

Course Requirements

Students are responsible for attending lecture. Lecture notes will be posted on-line. Students are also expected to participate in class discussions to a reasonable extent. This aids learning and provides valuable feedback on the lecture.

The teacher reserves the right to lower the grade of any student who is deficient in attendance and/or participation.

Homework, Assignments, and Tests

There will be two mid-term exams and one final examination. The second mid-term exam will mostly cover the material discussed and assigned after the first exam. There will be three homework assignments given out, mainly involving exercises from the book. There will be a programming project with several phases. The nature of the projects is to implement a database management system for data in XML. All programming assignments can be done with the computers in the instructional labs. Finally, there will be four discussions. Each discussion will cover material in a paper that is handed out in class.

The following allocation of grade percentages is tentative, and may change during the semester.


Exams (3): 43% (9, 9, 25)
Discussions (4): 8%
Project (4 phases): 34%
Homework (3): 15%

Cheating Policy

Exams, homework, and programming projects are subject to the CS Department policy on academic integrity. DO NOT CHEAT IN ANY WAY: DO YOUR OWN WORK! Side effects of cheating can be severe, and may include expulsion from the university.

Grading Policy

All grading will generally be marked within a week of the due date and returned to students in lecture. Additionally, some grades will be sent via e-mail. Assessment may be resubmitted for re-grading no later than one week after the assessment is returned. This is the only window of opportunity for re-grading. In order to submit a piece of assessment for re-grading, write or type a detailed explanation of the reasons for the re-grading. Then submit the re-grading to the teaching assistant or professor.

Students with Disabilities

Reasonable accommodations are available for students who have a documented disability. All accommodations must be approved through the Disability Resource Center (www.usu.edu/drc). Please notify the instructor during the first week of class of any accommodations needed for the course. Late notification may cause the requested accommodations to be unavailable. Any request for special consideration relating to attendance, pedagogy, taking of examinations, etc., must be discussed with and approved by the instructor. In cooperation with the Disability Resource Center, course materials can (sometimes) be provided in alternative format, large print, audio, portable storage, or Braille.

Topics

  • Review
  • Models
    • Relational Model - DRC and TRC
    • Historical Models - Appendix C, D
      • Network Model
      • Hierarchical Model
    • Logic/Deductive
    • OODBMS
    • XML and semistructured
  • Logical Design
    • Properties of a good design
    • Functional dependencies and keys
    • Normal forms: 3NF, BCNF, 4NF
    • Decomposition algorithms
  • Physical Data Organization
    • Relational structures: heap, sorted, compressed
    • Indexes: primary and secondary, B-trees
  • Query Optimization
    • Heuristic (logical) optimization
    • Cost-based (physical) optimization
  • Concurrency Control
    • ACID
    • Serializability
    • Two-phase locking
  • Recovery
    • System log
    • Undoing and redoing
  • Security
    • Roles
    • Properties
  • System Catalog
  • Future Topics
    • XML
    • Data warehousing
    • Data mining
    • Distributed databases
    • Next-generation database technologies

                                                                                                                                                                                                                                                                                                                                             
  E-mail questions or comments to Curtis.Dyreson at usu dot edu