Data Management Systems. 1.3 File Oriented Approach. JNTU World JNTU World. 1.1 Introduction. Database-management system (DBMS) is a collection of interrelated data and a set of programs to access those data. This is a collection of related data with an implicit meaning and hence is a database. The collection of data, usually. Database Management System, DBMS Study Materials, Engineering Class handwritten notes, exam notes, previous year questions, PDF free download.
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
IV Year B.Tech EEE. II-Sem T P C
4+1* 0 4
DATABASE MANAGEMENT SYSTEMS
(ELECTIVE-IV)
Objective:
Learn about database design concepts, data models (Entity-Relationship and Relational Model), the
database query language SQL and components of a database management system. Further topics
include query processing and optimization techniques, transaction management, and storage and file
structures
Syllabus:
UNIT – I:
Data base System Applications, data base System VS file System – View of Data – Data Abstraction –
Instances and Schemas – data Models – the ER Model – Relational Model – Other Models – Database
Languages – DDL – DML – database Access for applications Programs – data base Users and
Administrator – Transaction Management – data base System Structure – Storage Manager – the Query
Processor – History of Data base Systems.Data base design and ER diagrams – Beyond ER Design
Entities, Attributes and Entity sets – Relationships and Relationship sets – Additional features of ER Model
– Concept Design with the ER Model – Conceptual Design for Large enterprises.
UNIT – II:
Relational Model: Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing
Integrity constraints – Querying relational data – Logical data base Design – Introduction to Views –
Destroying /altering Tables and Views.
Relational Algebra and Calculus: Relational Algebra – Selection and projection set operations – renaming
– Joins – Division – Examples of Algebra overviews – Relational calculus – Tuple relational Calculus –
Domain relational calculus – Expressive Power of Algebra and calculus.
UNIT – III:
Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested Queries –
Correlated Nested Queries Set – Comparison Operators – Aggregative Operators – NULL values –
Comparison using Null values – Logical connectivity’s – AND, OR and NOTR – Impact on SQL Constructs
– Outer Joins – Disallowing NULL values – Complex Integrity Constraints in SQL 0 Triggers and Active
Data bases.
UNIT – IV:
Schema refinement – Problems Caused by redundancy – Decompositions – Problem related to
decomposition – reasoning about FDS – FIRST, SECOND, THIRD Normal forms – BCNF – Lossless join
Decomposition – Dependency preserving Decomposition – Schema refinement in Data base Design –
Multi valued Dependencies – forth Normal Form.
UNIT – V:
Overview of Transaction Management: ACID Properties – Transactions and Schedules – Concurrent
Execution of transaction – Lock Based Concurrency Control – Performance Locking – Transaction
Support in SQL – Introduction to Crash recovery.
UNIT – VI:
Concurrency Control: Serializability, and recoverability – Introduction to Lock Management – Lock
Conversions – Dealing with Dead Locks – Specialized Locking Techniques – Concurrency without
Locking.
Crash recovery: Introduction to ARIES – the Log – Other Recovery related Structures – the Write-Ahead
Log Protocol – Check pointing – re3covering from a System Crash – Media recovery – Other approaches
and Interaction with Concurrency control.
UNIT – VII:
Overview of Storage and Indexing: Data on External Storage – File Organization and Indexing – Cluster
Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree base
Indexing – Comparison of File Organizations – Indexes and Performance Tuning.
UNIT – VIII:
Storing data: Disks and Files: – The Memory Hierarchy – Redundant Arrays of Independent – Disks – Disk
Space Management – Buffer Manager – Files of records – Page Formats – record formats.
Page 85 of 85 2007-08
Tree Structured Indexing: Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM) – B+
Trees: A Dynamic Index Structure.
Hash Based Indexing: Static Hashing – Extendable hashing – Linear Hashing – Exendble vs. Liner
hashing.
Text Books:
1. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill
3rd Edition
2. Data base System Concepts, Silberschatz, Korth, Mc.Graw hill, IV edition.
References:
1. Introduction to Database Systems, C.J.Date Pearson Education
2. Data base Systems design, Implementation, and Management, Rob & Coronel 5th
Edition.Thomson
3. Data base Management System, Elmasri Navrate Pearson Education
4. Data base Management System Mathew Leon, Leon Vikas.
5. Data base Systems, Connoley Pearson education
4+1* 0 4
DATABASE MANAGEMENT SYSTEMS
(ELECTIVE-IV)
Objective:
Learn about database design concepts, data models (Entity-Relationship and Relational Model), the
database query language SQL and components of a database management system. Further topics
include query processing and optimization techniques, transaction management, and storage and file
structures
Syllabus:
UNIT – I:
Data base System Applications, data base System VS file System – View of Data – Data Abstraction –
Instances and Schemas – data Models – the ER Model – Relational Model – Other Models – Database
Languages – DDL – DML – database Access for applications Programs – data base Users and
Administrator – Transaction Management – data base System Structure – Storage Manager – the Query
Processor – History of Data base Systems.Data base design and ER diagrams – Beyond ER Design
Entities, Attributes and Entity sets – Relationships and Relationship sets – Additional features of ER Model
– Concept Design with the ER Model – Conceptual Design for Large enterprises.
UNIT – II:
Relational Model: Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing
Integrity constraints – Querying relational data – Logical data base Design – Introduction to Views –
Destroying /altering Tables and Views.
Relational Algebra and Calculus: Relational Algebra – Selection and projection set operations – renaming
– Joins – Division – Examples of Algebra overviews – Relational calculus – Tuple relational Calculus –
Domain relational calculus – Expressive Power of Algebra and calculus.
UNIT – III:
Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested Queries –
Correlated Nested Queries Set – Comparison Operators – Aggregative Operators – NULL values –
Comparison using Null values – Logical connectivity’s – AND, OR and NOTR – Impact on SQL Constructs
– Outer Joins – Disallowing NULL values – Complex Integrity Constraints in SQL 0 Triggers and Active
Data bases.
UNIT – IV:
Schema refinement – Problems Caused by redundancy – Decompositions – Problem related to
decomposition – reasoning about FDS – FIRST, SECOND, THIRD Normal forms – BCNF – Lossless join
Decomposition – Dependency preserving Decomposition – Schema refinement in Data base Design –
Multi valued Dependencies – forth Normal Form.
UNIT – V:
Overview of Transaction Management: ACID Properties – Transactions and Schedules – Concurrent
Execution of transaction – Lock Based Concurrency Control – Performance Locking – Transaction
Support in SQL – Introduction to Crash recovery.
UNIT – VI:
Concurrency Control: Serializability, and recoverability – Introduction to Lock Management – Lock
Conversions – Dealing with Dead Locks – Specialized Locking Techniques – Concurrency without
Locking.
Crash recovery: Introduction to ARIES – the Log – Other Recovery related Structures – the Write-Ahead
Log Protocol – Check pointing – re3covering from a System Crash – Media recovery – Other approaches
and Interaction with Concurrency control.
UNIT – VII:
Overview of Storage and Indexing: Data on External Storage – File Organization and Indexing – Cluster
Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree base
Indexing – Comparison of File Organizations – Indexes and Performance Tuning.
UNIT – VIII:
Storing data: Disks and Files: – The Memory Hierarchy – Redundant Arrays of Independent – Disks – Disk
Space Management – Buffer Manager – Files of records – Page Formats – record formats.
Page 85 of 85 2007-08
Tree Structured Indexing: Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM) – B+
Trees: A Dynamic Index Structure.
Hash Based Indexing: Static Hashing – Extendable hashing – Linear Hashing – Exendble vs. Liner
hashing.
Text Books:
1. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill
3rd Edition
2. Data base System Concepts, Silberschatz, Korth, Mc.Graw hill, IV edition.
References:
1. Introduction to Database Systems, C.J.Date Pearson Education
2. Data base Systems design, Implementation, and Management, Rob & Coronel 5th
Edition.Thomson
3. Data base Management System, Elmasri Navrate Pearson Education
4. Data base Management System Mathew Leon, Leon Vikas.
5. Data base Systems, Connoley Pearson education