0% found this document useful (0 votes)
34 views2 pages

1.2.3. Advanced Databases

The document outlines the course objectives, outcomes, and units for an advanced databases course. The course aims to provide an overview of indexing and hashing techniques, storage and query processing, document databases, and security and normalization. It covers topics like the entity relationship model, database queries, schema refinement through normalization, transaction management, and storage and indexing methods.

Uploaded by

LAVANYA SISTA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views2 pages

1.2.3. Advanced Databases

The document outlines the course objectives, outcomes, and units for an advanced databases course. The course aims to provide an overview of indexing and hashing techniques, storage and query processing, document databases, and security and normalization. It covers topics like the entity relationship model, database queries, schema refinement through normalization, transaction management, and storage and indexing methods.

Uploaded by

LAVANYA SISTA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Regulation Godavari Institute of Engineering & Technology

GRMT-20 (Autonomous) I M.Tech II Sem.


Course Code
20251263a
ADVANCED DATABASES
Teaching Total contact hours - 48 L T P C
Prerequisite (s): Any programming language 3 0 0 3

Course Objective(s):
 To provide overview of indexing and hashing techniques
 To impart knowledge of storage, query processing and optimization
 To introduce the concept of document oriented database.
 To create awareness about potential security and normalization to a database and
mechanisms to handle it.
 Understand the usage of advanced data models for real life application.

Course Outcome(s):
After successful completion of this course, a student will be able to-
CO-1: Build indexing and storage mechanisms for efficient retrieval of information from
databases.
CO-2: Measure query cost and optimize query execution
CO-3: Design database for better resource management
CO-4: Demonstrate the understanding of the concepts of document oriented databases.
CO-5: Apply appropriate normalization techniques database systems.
CO-6: Implement advanced data models for real life applications.

UNIT-1
Introduction: Database System VS file System, Advantages of a DBMS View of Data, Data
Abstraction, three-level schema structure instances and Schemas, , data types, table definitions,
data Models, ER Model, Relational Model, Other Models,
Database Languages: DDL, DML, DCL. Different types of data base Users and their
responsibility.

UNIT-2
The Entity Relationship Model: 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, and Conceptual Design for Large enterprises.

UNIT-3
Database Query Operation: DML operations- Procedural (selection, projection, set difference,
cartesian product, join) and non-procedural: domain and tuple calculus, DDL operations. Basic
SQL querying (select and project) using where clause, sub queries, grouping, aggregation,
ordering, implementation of different types of joins.
UNIT-4
Schema Refinement (Normalization): Purpose of Normalization, concept of functional
dependency, normal forms based on functional dependency (1NF, 2NF and 3 NF), Boyce-Codd
normal form (BCNF), Lossless join and dependency preserving decomposition, Fourth normal
form (4NF).
Transaction Management: Transaction, properties of transactions, transaction log, and
transaction management with SQL using commit rollback and save point.

UNIT-5
Storage and Indexing: Data on External Storage, File Organization and Indexing –Clustered
Indexes, Primary and Secondary Indexes, Index data Structures – Hash Based Indexing, Tree
based Indexing, Comparison of File Organizations.
Storing data, Disks and Files: -The Memory Hierarchy – Redundant Arrays of Independent
Disks. Tree Structured Indexing: Intuitions for tree Indexes, Indexed Sequential Access Methods
(ISAM)
B+ Trees: A Dynamic Index Structure, Search, Insert, and Delete. Hash Based Indexing: Static
Hashing, Extendable hashing, Linear Hashing, Linear hashing.

Text Books
1. Database Management Systems, Raghu Ramakrishna, Johannes Gehrke, TMH, 3rd Edition,
2003.
2. Database System Concepts, A.Silberschatz, H.F. Korth, S. Sudarshan, McGraw hill, VI
Edition, 2006.
3. Fundamentals of Database Systems 5th edition. Ramez Elmasri, Shamkant B.Navathe,
Pearson Education, 2008.

Reference Books
1. Database Management System Oracle SQL and PL/SQL,P.K.Das Gupta, PHI.
2. Database System Concepts, Peter Rob & Carlos Coronel, Cengage Learning, 2008.
3. Database Systems, A Practical approach to Design Implementation and Management
Fourth edition, Thomas Connolly, Carolyn Begg, Pearson education.

CO-PO Mapping:
(1: Slight [Low]; 2: Moderate[Medium]; 3: Substantial[High]; '-' : No Correlation)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 - - - - - - - - - - -
CO2 - - 2 1 - - - - - - - -
CO3 - - - - 3 - - - - - - -
CO4 - - 3 - 1 - - - - - - -
CO5 - - - - 3 1 - - - - - -
CO6 - - - - - 2 - - - - - -

You might also like