RAJALAKSHMI ENGINEERING COLLEGE Thandalam, Chennai – 602 105 LESSON PLAN
Faculty Name Subject Name
: :
P.REVATHY DATABASE MANAGEMENT
Code Code
: :
CS11 CS1301
Year Degree & Branch
: :
SYSTEM III B.E. – C.S.E.
Semester Section
: :
V A& B
Aim:
• To provide a strong foundation in database technology and an introduction to the current trends in this field..
Objectives: • To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram. • To make a study of SQL and relational database design. • To understand the internal storage structures using different file and indexing techniques which will help in physical DB design. • To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure. • To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML TEXT BOOK
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan - “Database System Concepts”, Fourth Edition, McGraw-Hill, 2002. Reference Book(s): 1. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003. 2.
Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003. 3. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2000. Sl. No. 1
Unit I
Topic(s) Introduction, File system VS Database system
T / R*
Book
Book
No.
T/R
1/2
Signature of Faculty
Page(s) 1-6/9-15
Signature of HOD 1
Reference Book(s): 2 Database System Structure 3 Data Models Introduction to Network 4 Model Introduction to Hierarchical 5 Model 6 ER Model 9 Relational Model Relational Algebra and 10 Calculus 13 II SQL ,Data Data Definition 17 Integrity and security 18 Relational Database Design 19 Functional Dependences Normalization for 21 Relational DB Record Storage ,Primary Primary 23 III File Organization 25 Secondary Storage Devices 26 Operations on Files 27 Hashing Tehniques 29 Index Structure for files fil s 30 B Tree. B+ Tree 31 Query Processing Transaction ProcessingIntroduction, Introduction Need For 33 IV Concurrency Control. Desirable Properties of Transaction Serializability and 35 Schedules Concurrency control Tech: 37 Types Of Locks- Two Phase Locking. Dead Lock Time Stamp Based 38 Concurrency Control Sl. Unit Topic(s) No. Recovery Tech: Immediate 39 Update,, Deferred Update 41 Shadow Paging Object Oriented DB-Need 42 V for Complex Data Types ,OO OO Data Model Nested Relations. Complex 43 Types Inheritance & Reference 45 types
T R
1 1
16-18 7-11
R
2
917-940
R
2
942-948
R T/R
1 1
23-40 63-70
T/R
1/2
71-100/211,299
T/R T R T
1/2 1 1 1
111-147/251 193-201 215 202-210
T/R
1/2
221-231/483-495
T/R
1/2
293/113
T/R R T/R T R T
1/2 2 1 1 1/2 1
293-300/117-126 133-134 358-365 339-345 346-357/169-180 381-412
T
1
439-449
T
1
451-455
T/R
1
471-481
T
1
471-481
T / R*
Book
Book
No.
T
1
511-524
T/R
1
525-527
T
1
251-265
T
1
275-277
T
1
277-300
Signature of Faculty
Page(s)
Signature of HOD 2
Reference Book(s): Distributed DB46 Homogenous and Heterogenous 47 XML. Structure of XML Querying and 49 Transformation 50 Data Mining&Warehousing Mining •
R
2
766-780
T
1/2
346/879
T
1
347
T
702-709
T Text Book / R Reference Book
Signature of Faculty
Signature of HOD 3