Management Russ Wakefield TAs TBD On Campus and Distance Learning - PDF document

5/20/2015 Database Systems Management Russ Wakefield TAs – TBD On Campus and Distance Learning What is CS430 / CS430dl?  Instructor & 2 TAs  4-6 Homework assignments  4-6 Lab assignments  Computer Systems / Labs  Discussion assignments (on-line)  Quizzes (on-line)  1 Midterm & Final  Course Objectives  Syllabus Objectives Ch. 1 – Overview of Database Systems To provide an overview of DBMS. • To identify the components of a DBMS and what they are • used for. Ch. 2 – Introduction to Database Design To introduce the concept of Entity Relationship design • • To identify the components of ER design and how they are used To identify the guidelines for using the ER model • effectively 1

5/20/2015 Objectives Ch. 3 - The Relational Model To identify how data is represented in the • relational model. To introduce SQL and show how to create, • modify, and query tables using SQL • To show how to translate between the ER model and a relational database design • To introduce views and show how they are used Objectives Ch. 4 – Relational Algebra • To introduce the concept of relational algebra and understand its importance as the foundation of relational query languages such as SQL • To describe the relational operators and show how they are combined to produce complex queries • To introduce the concept of relational calculus and show it’s importance Objectives Ch. 5 – SQL: Queries, Constraints, and Triggers To expand the concepts introduced in Chapter • 3 to include more complex operations performed in SQL. To introduce triggers and show how they are • used. To introduce grouping and show how it is used • with aggregate operations. To introduce nested queries and null values. • 2

5/20/2015 Objectives Ch. 19 – Schema Refinement and Normal Forms To understand the issues associated with redundancy of • data To understand what functional dependencies are and how • they relate to redundancy To understand what normal forms are and why we • identify them To understand the considerations in decompostion. • Objectives Ch. 6 – Database Application Development To show how application programs connect to a • DBMS, manipulate and modify the data in that DBMS. To introduce JBDC and show how it is used. • Objectives Ch. 8 – Overview of Storage & Indexing To describe how a DBMS stores and access • persistent data To define what indexes are and describe how • they are used. To show how a hash-based index works and when • it is most effective To show how a tree-based index works and when • it is most effective 3

5/20/2015 Objectives Ch. 9 - Storing Data: Disks and Files To identify the characteristics of the • different types of memory in a computer system • To describe how a DBMS creates and maintains files of records, how those records are arranged on pages, and how pages are organized within the file Objectives Ch. 10 - Tree-structured indexing To describe what the intuition behind tree- • structured indexes are and why they are good for range selection. To explain how a B+ tree index handles • search, insert, and delete To explain how an ISAM index handles • search, insert, and delete Objectives Ch. 11 - Hash-based indexing To identify the intuition behind hash- • structured indexes and show how they are effective To define extendible hashing and show how • it handles search, inserts, and deletes To define linear hashing and show how it • handles search, inserts, and deletes. 4

5/20/2015 Objectives Ch. 12 – Query evaluation To identify the descriptive information • stored in its catalog. To show what a query evaluation plan is and • how they are represented To show how a DBMS implements several • algorithms for each algebra operation and to show what factors affect the relative performance of these algorithms Objectives Ch. 16 - Transaction Management To identify the properties of transactions • that a DBMS guarantees To explain why DBMS interleave • transactions and identify mechanisms such as locks and correctness to handle interleaving To show the impact of these mechanisms • on performance Objectives Ch. 17 - Concurrency Control To show how strict 2PL ensures serializability • and recoverability To describe how locks are implemented in a • DBMS, what lock conversions are, and why they are important To describe concurrency control mechanisms • such as time-stamping and multiversioning work. 5

5/20/2015 Objectives Ch. 18 - Recovery To show what steps are taken in the ARIES • method to recover from DBMS crashes To describe how logs are maintained and • how they are used to recover from a crash To identify the concepts behind checkpoints • and show how they are used. To show how recovery interacts with • concurrency control Discussion Assignments  Canvas  Weekly discussion assignment  Posted to your group discussion board  Consensus answers posted to main discussion board  When required  Initial posting – 70% (due Thursday)  Response – 30% (due Sunday) Computer Systems / Labs  Assignments done using computer systems in C120 (Linux based, multi-core boxes)  May use home equipment – but GTA will grade using the state capital boxes.  If it doesn’t run in that environment, it will be graded accordingly  Department policy  Every student enrolled in a CS class is given an account in the CS environment  Our MySQL server is faure.cs.colostate.edu 6

5/20/2015 Homework / Programming Assignments  5 homework assignments  Questions in the homework assignment  4 lab assignments  Done using the state capital machines  SQL, design and build database  Java program using the JDBC interface  XML parser Late and Regrade Policy  Assignments are due on Tuesdays and Thursdays  Programming / Homework  Assignments have a 1 week late period.  Graded assignments will be returned after the late period ends.  All assignments turned in on time are allowed a regrade submission of the missed points for 80% of the original value  The regrade submission period lasts for 1 week after the late period.  Late assignments have no penalty, but are not allowed the regrade submission. Quizzes  Weekly quizzes over the reading material  3 attempts  Only highest attempt counts for grade  Open book, open notes  NOT open person 7

5/20/2015 Exams  Midterm exam during week 6  Final exam during week 12  Series of timed online quizzes  72 hours  Sunday, Monday, Tuesday  Study guide will be published in advance Syllabus  http://www.cs.colostate.edu/~cs430dl Where do I get help ?  The book – reading is a good thing.  Your classmates – this is a large class, find allies.  Not TOO good of allies – cheating will be dealt with harshly..  The Instructor and GTA  We have office hours, use them. Our salaries are paid by your tuition – you are entitled to our time.  If our office hours are not timely – set up an appt. Like all geeks, we live glued to computer screens. 8

5/20/2015 Where do I get help?  Discussion Board  If you have a question, odds are 20 other people have the same question.  The TAs and I will check the boards regularly  Google / Stack Overflow  Again – not TOO much of Google, see above re: cheating  Sharing code, posting code is considered cheating!! 9