Syllabus - Compre
Syllabus - Compre
2. Text Book
Hector G Molina, Jeffrey D.Ullman and Jennifer Widom, Database Systems – The Complete Book, Pearson
Education, 2e, 2008.
3. Reference Books
R1. Ramakrishna R. & Gehrke J, Database Management Systems, 3e, Mc-Graw Hill, 2003.
R2. Silberschatz A, Korth H F, & Sudarshan S, Database System Concepts, 7e, TMH, 2019.
R3. Elmarsi R, & Navathe S B, Fundamental of Database System, 7e, Pearson Education, 2017.
R4. Robinson, I, Webber, J, & Eifrem E, Graph Databases, 2e, O’Reilly, 2015.
4. Lecture Plan
Lecture Topics Chapter Reference
Learning Objective
#
§ Objectives/Motivation Ch. 1
1-2 § Evolution of Database Systems R1:Ch. 1
§ Overview of a DBMS R2:Ch. 1
Introduction to Database Systems
§ Advantages of a DBMS R3:Chs. 1-2
§ Recent Advances in Database Technology
§ Database System Architecture
Overview of Data Modeling Ch. 2
Self Study R1:Ch. 2
§ Entity-Relationship (ER) Modeling R2:Ch. 6, App. A, B
3-4 Data Modeling
§ Enhanced ER (EER) Modeling R3:Chs. 3-4, App. E, F
§ Network Data Model
§ Hierarchical Data Model
§ Relational Model Concepts Ch. 3
5-7 § Relation as a Mathematical Model R1:Ch. 3
Understanding Relational Model
§ ER, EER to Relational model R2:Chs. 2, 6
R3:Ch. 7
§ Functional Dependencies Ch. 3
Database Design through § Normal Forms: 1NF,2NF,3NF, BCNF R1:Ch. 19
8-12 Functional Dependencies & § Criterion for Good Database Design R2:Ch. 7, App. C
Normalization § Multi-valued dependencies: 4NF R3:Chs. 10-11
§ Join Dependencies-5NF, PJNF (self study)
§ Relational Algebra Ch. 5
§ Relational Calculus R1:Ch. 4
13-16 Query Languages § Tuple Relational Calculus R2:Chs. 2, 5
§ Domain Relational Calculus R3:Ch. 6
§ SQL (to be covered in Lab. Sessions) + Class Notes
§ File Organizations Chs. 11-14
§ Organization of Records in Files R1:Chs. 8-11
§ Indexing Structures R2:Chs. 11-12
§ Primary & Secondary Indexes R3:Chs. 13-14
17-23 Data Storage & Indexing
§ Tree-structured Indexes
§ Hash-based Indexes
§ Multidimensional Indexes
§ Bitmap Indexes
§ Introduction to Operator Evaluation Chs. 15-16
§ Algorithms for Relational Operators R1:Chs. 12-15
§ Sorting R2:Chs. 13-14
24-30 Query Processing & Optimization § Cost-based Optimization R3:Ch. 15
§ Heuristic-based Optimization
§ System-R approach to Optimization
§ View Materialization
§ Transaction Management Overview Chs. 17-19
§ Serial Schedule & Serializability R1:Chs. 16-18
o Conflict Serializability R2:Chs. 15-17
o View Serializability R3:Chs. 17-19
o Testing for Serializability
Transaction management: § Recoverability & Cascadeless
31-36
Concurrency Control & Crash Schedules
Recovery § Concurrency Control
§ Locking
§ Timestamping
§ Crash Recovery
§ Log-Based
§ Shadow Paging
§ Big Data & NoSQL Databases Chs. 19
o Column-oriented Databases R4
o Graph Databases Class Notes
37-40 o Key-value pair Databases
Advanced Topics
o Document Databases
§ Web Databases
5. Evaluation components
Component Duration Weightage(%) Date & Time Mode
Midsem 90 Mins. 30 (60 Marks) 04/03 FN1 Closed Book
Quizzes (02) 45 Mins. 30 (60 Marks) TBA Closed Book
Assignments (02)* - 0 (non-evaluatory) - Take Home
Comprehensive Exam 3 Hrs. 40 (80 Marks) 05/05 FN Partly Open
* There will be questions based on assignments in Midsem & Comprehensive exams (max. combined weightage: 10%)
6. Labs
A 2-hour, supervised lab., will be organized every week. The labs will focus on learning SQL and a suitable host language.
No marks for attendance. There will be no lab test. Questions based on the topics/concepts covered in labs. in the Midsem
and Comprehensive exam (max. combined weightage: 10%)
7. Make-up Policy
Make-up will be granted strictly on prior permission and for genuine reasons only.
8. Chamber Consultation Hours: T Th - 10
9. Notice: All the notices will be put up on NALANDA only.
Instructor-in-Charge
CS F212