SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF COMPUTING DEPARTMENT OF CSE COURSE PLAN Course Code : CS0304 Course Title : Data Base Management Systems Semester : VI Course Time : Dec 2012- May 2013 DAY SECTION A B C D E Hour Timing Hour Timing Hour Timing Hour Timing Hour Timing 1 6 2.20-3.10 2,4 2 2,4 9:35-10.25, 11.25-12:15 3 2 9.35-10.25 2,4 4 11.25-12:15 5 1.30-2.20 9:35-10.25, 11.25-12:15 1,4 8.45-9.35, 11.25-2:15 9:35-10.25, 11.25-12:15 1 8.45-9.35 4,6 11.25-12:15 2.20-3.10 4 1 8.45-9.35 1 8.45-9.35 2 9.35-10.25 5 1 8.45-9.35 2 9.35-10.25 Location: SRM UNIVERSITY, TECH PARK Faculty Details SEC NAME OFFICE A B C D Mr. Arul prakash Ms.J.Ramaprabha Ms.R.Mangalagowri Mrs.G.Sivagami OFFICE HOUR MAIL ID TP706B Mon -Fri arulprakash.m@ktr.srmuniv.ac.in TP810C Mon -Fri ramaprabha.j@ktr.srmuniv.ac.in TP803A Mon -Fri mangalagowri.r@ktr.srmuniv.ac.in TP803A Mon -Fri sivagami.g@ktr.srmuniv.ac.in E Mr. T.Senthil kumar TP706A Mon -Fri senthilkumar.t@ktr.srmuniv.ac.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, Addision Wesley, 2000. Web resources: http://www.cs.helsinki.fi/u/laine/tikape/k03/material03.html http://infolab.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 Outcomes Students who have successfully completed this course will have full understanding Of the following concepts Course outcome To Learn a conceptual model using ER diagrams and 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 Program outcome 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 Session 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 No. 1 2 3 Topics to be covered The Evolution of Database Systems Overview of a Database Management System Outline of Database-System Studies Time (min) Ref Teaching Method Testing Method 4 Entity-Relationship Data Model 5 Elements of the E/R Model 6 Entity Relationship Diagrams 7 Design Principles 8 The Modeling of Constraints 9 Weak Entity Sets 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 11 E/R Diagrams to Relational Designs 12 Converting Subclass Structures to Relations 13 Functional Dependencies Surprise Test
14 Rules About Functional Dependencies 15 Design of Relational Database Schemas 16 Multi valued Dependencies 17 Relational Algebra: Relational Operations, 18 Extended Operators of Relational Algebra, Constraints on Relations. SQL Simple Queries in SQL-Sub queries-full-relation Operations-Database Modifications-Defining a Relation Schema-View Definitions- Constraints and Triggers: Keys and Foreign Keys-Constraints on Attributes and Tuples-Modification of Constraints-Schema-Level Constraints and Triggers -Java Database Connectivity- Security and User Authorization in SQL 19 20 Simple Queries in SQL Sub queries 21 Full-Relation Operations 22 Database Modifications-Defining a Relation Schema 23 View Definitions- Constraints and Triggers: Keys and Foreign Keys 24 Constraints on Attributes and Tuples, Modification of Constraints 25 Schema-Level Constraints and Triggers, Comparative study Surprise Test 26 Java Database Connectivity 27 Security and User Authorization in SQL INDEX STRUCTURE, QUERY PROCESSING Index Structures:Indexes on Sequential Files-Secondary Indexes-B-Trees-Hash Tables-Bitmap Indexes-Query Execution: Physical-Query-Plan Operators-One-Pass, two-pass & index based Algorithms, Buffer Management, Parallel Algorithms-Estimating the Cost of Operations-Cost-Based Plan Selection -Order for Joins-Physical-Query-Plan 28 Indexes on Sequential Files
29 30 Secondary Indexes B-Trees 31 Hash Tables-Bitmap Indexes 32 33 Physical-Query-Plan Operators-One-Pass Algorithms Two-pass & index based Algorithms 34 Buffer Management, Parallel Algorithms 35 Estimating the Cost of Operations Cost- Based Plan Selection Order for Joins-Physical-Query-Plan 36 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 Serializability by Locks-Locking Systems With Several Lock Modes-Concurrency Control by Timestamps, validationtransaction management: Serializability and Recoverability-View Serializability-Resolving Deadlocks- Distributed Databases: commit& lock. 37 Issues and Models for Resilient Operation - Undo/Redo Logging 38 39 40 41 Protecting against Media Failures, Concurrency Control Serial and Serializable Schedules, Conflict- Serializability Enforcing Serializability by Locks, Locking Systems With Several Lock Modes, 42 Concurrency Control by Timestamps, Validation 43 Serializability and Recoverability,
44 View Serializability, Resolving Deadlocks 45 Distributed Databases, commit& lock BB Black Board PPT Power Point Presentation Prepared by Approved by R.MANGALAGOWRI HOD / CSE