Course Code : CS0304 Course Title : Data Base Management Systems Semester : VI Course Time :Jan 2015- May 2015 DAY 1 08.45 09.35 2 09.35 10.25 SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN 3 10.35 11.25 1 C1 4 11.25 12.15 12.15 01.30 LUNCH 5 01.30 02.20 6 02.20 03.10 C2 7 03.10 04.00 2 C2 C1 3 4 5 C1 C2 Note : C1 = A,C,E,G,I C2 = B,D,F,H,J Location: SRM UNIVERSITY, TECH PARK Faculty Details SEC NAME OFFICE OFFICE MAIL ID HOUR C1 Mrs.AKILANDESWARI TP802B Mon -Fri Akilandeswari.p@ktr.sr muniv.ac.in C1 Mr.C.JOTHI KUMAR TP708B Mon -Fri jothikumar.c@ktr.srmuni ac.in C1 Mrs.S.KIRUTHIKA DEVI TP803A Mon -Fri kiruthukadevi.s@ktr.srm niv.ac.in C1 Mr.A.MURUGAN TP703A Mon -Fri murugan.a@ktr.srmuniv. ac.in C2 Mr.A.SELVAKUMAR TP708D Mon -Fri selvakumar.a@ktr.srmun.ac.in C2 Mrs.G.SIVAGAMI TP803A Mon -Fri sivagami.g@ktr.srmuniv..in C2 Mr.R.SUBASH TP610A Mon -Fri subash.r@ktr.srmuniv.ac. C2 Ms.J.V.VIDHYA TIP803A Mon -Fri vidhya.j.v@ktr.srmuniv.a in
Required Text Books: 1. Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom, "Database Systems: The Complete Book" - Pearson Education, 2002. Reference Books: 1. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts, 4rth Edition, McGraw-Hill International, 2002. 2. R. Elmasri and Shamakant B. Navathe, Fundamentals of Database Systems, 3rd Edition, AddisionWesley, 2000. Web resources: http://www.cs.helsinki.fi/u/laine/tikape/k03/material03.html http://i nfolab.stanford.edu/~ullman/dscb.html http://cs.nyu.edu/courses/spring06/g22.2433-001/ Prerequisite: CS0201 Data Structures using C++ MA0101 Mathematics I Objectives To study the concepts of Relational Database design and query languages. To provide a general introduction to Relational model To learn about ER diagrams To learn about Query processing and Transaction Processing Assessment Details Cycle Test I : 10 Marks Cycle Test II : 10 Marks Model Exam : 20 Marks Surprise Test : 5 Marks Attendance : 5 Marks Test Schedule S.No. DATE TEST TOPICS DURATION 1 Cycle Test - I Unit I & II 2 periods 2 Cycle Test - II Unit III & IV 2 periods 3 Model Exam All 5 units 3 Hrs To Learn a conceptual model using ERdiagramsand their representation in RDBMS To Learn database Normalization To Understand and execute SQL commands To Understand the Query Processing, Query Execution & Query Plan To Learn various mechanism to Recover from Failure & Concurrency Control. An ability To design ER Model for any application To Decompose any Schema by applying normal forms To construct SQL queries for any requirement To write Trigger, Cursor,PL/SQL Programs and to design object oriented, extended relational schemas To Understand the Query Evaluation and Execution processes.
Detailed Course Plan INTRODUCTION The Evolution of Database Systems- Overview of a Database Management System-Outline of Database-System Studies-The Entity-Relationship Data Model: Elements of the E/R Model-Design Principles-The Modeling of Constraints-Weak Entity Sets. Session Topics to be covered Time Ref Teaching Testing Method No. (min) Method 1 The Evolution of Database Systems 50 T1,R BB,PPT 2 Overview of a Database Management System 50 T1,R BB,PPT 3 Outline of Database-System Studies 50 T1,R BB,PPT Comparativestudy 4 Entity-Relationship Data Model 50 T1,R BB,PPT Groupdiscussion 5 Elements of the E/R Model 50 T1,R BB,PPT 6 Entity Relationship Diagrams 50 T1,R BB,PPT 7 Design Principles 50 T1,R BB,PPT 8 The Modeling of Constraints 50 T1,R BB,PPT 9 Weak Entity Sets 50 T1,R BB,PPT THE RELATIONAL DATA MODEL & ALGEBRA Basics of the Relational Model-From E/R Diagrams to Relational Designs-Converting Subclass Structures to Relations- Functional Dependencies-Rules About Functional Dependencies-Design of Relational Database Schemas Multi valued Dependencies- Relational Algebra: Relational operations-extended Operators of Relational Algebra- Constraints on Relations. 10 Basics of the Relational Model 50 T1,R BB,PPT 11 E/R Diagrams to Relational Designs 50 T1,R BB,PPT Objectivetypetest 12 Converting Subclass Structures to Relations 50 T1,R BB,PPT 13 Functional Dependencies 50 T1,R BB,PPT Surprise Test 14 Rules About Functional Dependencies 50 T1,R BB,PPT 15 Design of Relational Database Schemas 50 T1,R BB,PPT 16 Multi valued Dependencies 50 T1,R BB,PPT, 17 Relational Algebra: Relational Operations 50 T1,R BB,PPT
18 Extended Operators of Relational Algebra, Constraints on Relations. 50 T1,R BB,PPT SQL Simple Queries in SQL-Sub queries-full-relation Operations-Database Modifications-Defining a RelationSchema- View Definitions- Constraints and Triggers: Keys and Foreign Keys-Constraints on Attributes andtuples-modification of Constraints-Schema-Level Constraints and Triggers -Java Database Connectivity-Security and User Authorization in SQL 19 Simple Queries in SQL 50 T1,R BB,PPT Objective type test 20 Sub queries 50 T1,R BB,PPT 21 Full-Relation Operations 50 T1,R BB,PPT, Comparative study 22 Database Modifications-Defining a RelationSchema 50 T1,R BB,PPT 23 View Definitions- Constraints and Triggers:KeysandForeignKeys 50 T1,R BB,PPT Objective type test 24 Constraints on Attributes and Tuples, ModificationofConstraints 50 T1,R BB,PPT 25 Schema-Level Constraints and Triggers 50 T1,R BB,PPT Surprise Test 26 Java Database Connectivity 50 T1,R BB,PPT 27 Security and User Authorization in SQL 50 T1,R BB,PPT INDEX STRUCTURE, QUERY PROCESSING Index Structures:Indexes on Sequential Files-Secondary Indexes-B-Trees-Hash Tables-Bitmap Indexes- QueryExecution: Physical-Query-Plan Operators-One-Pass, two-pass & index based Algorithms, BufferManagement, Parallel Algorithms-Estimating the Cost of Operations-Cost-Based Plan Selection -Order forjoins-physical-query-plan 28 Indexes on Sequential Files 50 T1,R BB,PPT 29 Secondary Indexes 50 T1,R BB,PPT Groupdiscussion 30 B-Trees 50 T1,R BB,PPT 31 Hash Tables-Bitmap Indexes 50 T1,R BB,PPT,, Objective type test 32 Physical-Query-Plan Operators-One-Pass Algorithms 50 T1,R BB,PPT Objective type test,,group discussion 33 Two-pass & index based Algorithms 50 T1,R BB,PPT,Groupdiscussion
, 34 Buffer Management, Parallel Algorithms 50 T1,R BB,PPT, 35 Estimating the Cost of Operations Cost-Based Plan Selection 50 T1,R BB,PPT Objective type test, 36 Order for Joins-Physical-Query-Plan 50 T1,R BB,PPT, Group discussion FAILURE RECOVERY AND CONCURRENCY CONTROL Issues and Models for Resilient Operation -Undo/Redo Logging-Protecting against Media Failures-Concurrency Control: Serial and Serializable Schedules-Conflict-Serializability-Enforcing SerializabilitybyLocks-Locking Systems With Several Lock Modes-Concurrency Control by Timestamps, validation-transaction management: Serializability and Recoverability-View Serializability-Resolving Deadlocks-Distributed Databases: commit& lock. 37 Issues and Models for Resilient Operation -Undo/Redo Logging 50 T1,R BB,PPT 38 Protecting against Media Failures, ConcurrencyControl 50 T1,R BB,PPT 39 Serial and Serializable Schedules, Conflict-Serializability 50 T1,R BB,PPT 40 Enforcing Serializability by Locks 50 T1,R BB,PPT,Group discussion 41 Locking Systems With Several Lock Modes 50 T1,R BB,PPT,, 43 Serializability and Recoverability 50 T1,R BB,PPT,, 44 View Serializability, Resolving Deadlocks 50 T1,R BB,PPT,, 45 Distributed Databases, commit& lock 50 T1,R BB,PPT Group discussion, BB Black Board PPT Power Point Presentation Prepared by Approved by
A.Murugan HOD / CSE