Professional Documents
Culture Documents
UNIVERSITY, ANANTAPUR::SYLLABUS
III B.Com. (Computer Applications) E.M.
Paper:315. Paper – XXIII : Relational Data Base Management Systems
(Revised regulations with effect from 2010–2011)
Theory periods per week : 3Theory Maximum Marks : 100 Time : 3 Hrs.
Unit-I : Introduction : Database-System Applications – Purpose of Database Systems –
View of Data – Database Languages – Relational Databases – Database Design –
Object-Based and Semistructured Databases – Data Storage and Querying – Transaction
Management – Data Mining and Analysis – Database Architecture – Database Users and
Administrators – History of Database Systems
Relational Model : Structure of Relational Databases – Fundamental, Additional and
Extended Relational-Algebra Operations – Null values – Modification of the Database
Unit-II : SQL : Background – Data Definition – Basic Structure of SQL Queries – Set
Operations – Aggregate Functions – Null values – Nested Subqueries and Complex
Queries – Views – Modification of the Database – Joined Relations
Advanced SQL : SQL Data Types and Schemas – Integrity Constraints – Authorization
– Embedded and Dynamic SQL – Functions and Procedural Constructs – Recursive
Queries – Advanced SQL Features
Other Relational Languages : The Tuple Relational Calculus – The Domain Relational
Calculus – Query-by-Example – Datalog
Unit-III : Database Design and the E-R Model : Overview of the Design Process – The
E-R Model – Constraints – E-R Diagrams, Design Issues – Weak Entity Sets – Extended
E-R Features – Database Design for Banking Enterprise – Reduction to Relational
Schemas – Other Aspects of Database Design
Relational Database Design : Features of Good Relational Designs – Atomic Domains
and First Normal Form – Decomposition using Functional Dependencies – Functional
Dependency Theory – Decomposition using Functional and Multivalued Dependencies –
More Normal Forms – Database-Design Process – Modeling Temporal Data
Unit-IV : Query Processing : Overview – Measures of Query Cost – Selection
Operation – Sorting – Join Operation – Other Operations – Evaluation of Expressions
Query Optimization : Overview – Transformation of Relational Expressions –
Estimating Statistics of Expression Results – Choice of Evaluation Plans – Materialized
Views
Unit-V : Transactions : Transaction Concept – Transaction State – Implementation of
Atomicity and Durability – Concurrent Executions – Serializability – Recoverability
Concurrency Control : Lock-Based Protocols – Timestamp-Based Protocols –
Validation-Based Protocols – Multiple Granularity – Multiversion Schemes – Deadlock
Handling – Insert and Delete Operations – Weak Levels of Consistency
Recovery System : Failure Classification – Storage Structure – Recovery and Atomicity
– Log-Based Recovery – Recovery with Concurrent Transactions – Buffer Management
– Failure with Loss of Nonvolatile Storage – Advanced Recovery Techniques – Remote
Backup Systems.
(Scope and standard as in chapters 1 to 7, 13 to 17 in Book No.1 referred below)
1. Explain about the three levels of Data Abstraction.
Ans. 1. Physical Level – Describes how the data is stored in database
2. Logical Level - Describes what data to be kept in the database
3. View level – Describes user view of data in the database.
11. Define E-R diagram. Construct an E-R diagram for a hospital with a set of patients
and a set of medical doctors. Associate with each patient a log of the various tests
and examinations conducted.
12. What is Normalization ? Explain about 1NF, 2NF and 3NF with suitable examples.