DBMS (CS 1301) – Anna University

ABSTRACT

This article gives the syllabus of the Anna University course in Database Management Systems (CS 1301) and explains how the book Fundamentals of Database Management Systems could be used efficiently, effectively and quickly to learn the subject fulfilling the aim and objectives of the course.

CONTENTS

Aim
Objectives
Syllbus

Unit I – Introduction and Conceptual Modeling
Unit II – Relational Model
Unit III – Data Storage And Query Processing
Unit IV – Transaction Management
Unit V – Current Trends

Summary

AIM

This main aim of this course is to provide a strong foundation in database technology, database management systems and to provide an introduction to the current trends in database field.

OBJECTIVES

The main objectives of this course are:

• To learn the fundamentals of data models and to conceptualize and depict a database system using E-R 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 database design.
• To know the fundamental concepts of transaction processing—concurrency control techniques and recovery procedures.
• To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.

Unit I – Introduction and Conceptual Modeling

01. Introduction to file and database systems [Chapter 1]
02. Database system structure [Chapter 1]
03. Data Models [Chapter 03]

Hierarchical model [3.4]
Network model [3.5]
Relational Model [3.6]
E-R model [3.7]

04. Relational Algebra [Chapter 10]
05. Relational Calculus [Chapter 11]

Unit II – Relational Model

01. Introduction to SQL [Chapter 12]
02. Data definition [Chapter 15]
03. Queries in SQL [Chapter 16]
04. Updates [Chapter 18]
05. Views [Chapter 15]
06. Integrity and Security [Chapters 7, 27 and 28]
07. Relational Database design [Chapters 2, 7, 8 and 9]
08. Functional dependences [Chapter 9]
09. Normalization for Relational Databases (up to BCNF) [Chapter 9]

Unit III – Data Storage and Query Processing

01. Secondary storage devices [Chapter 23]
02. Record storage and primary file organization [Chapter 24]
03. Operations on Files [Chapter 24]

Heap File [Forthcoming Article]
Sorted Files [Forthcoming Article]

04. Indexing and Hashing [Chapter 25]

Hashing Techniques [25.3]
Index structure for files [25.2]
Different types of Indexes: B-Tree, B⁺-Tree [25.2.1.3 and 25.2.1.4]

05. Query Processing [Chapter 26]

Unit IV – Transaction Management

01. Transaction Processing [Chapter 29]

Need for concurrency control [29.6]
Desirable properties of transaction [29.3]
Schedule and Recoverability [29.8]
Serializability and Schedules [29.7]
Concurrency Control [29.9]
Types of Locks [29.9.1]
Two-phase locking [29.9.2]
Deadlock [29.9.3]
Timestamp-based concurrency control [29.9.5]

02. Recovery [Chapter 30]

Recovery Concepts [30.11, 30.12 and 30.13]
Recovery Techniques [30.15]
Deferred Update [30.15.1]
Immediate Update [30.15.2]
Shadow Paging [30.15.3]

Unit V – Current Trends

01. Object Oriented Databases [Chapter 33]

Need for complex data types [33.1 and 33.2]
Object-oriented data model [33.3 and 33.4]
Nested relations, Complex Types, Inheritance, Reference Types [33.5]

02. Distributed databases [Chapter 32]

Homogenous and heterogeneous distributed databases [32.7]
Distributed data storage [32.8]

03. XML [Chapter 34]

XML Data [34.10 and 34.11]
XML Document [34.1 and 34.5]
XML Schema [34.1 and 34.5]
Structure of XML [34.6]
Querying and Transformation [34.15]

04. Data Warehousing [Chapter 36]
05. Data Mining [Chapter 37]