0% found this document useful (0 votes)
53 views4 pages

Database Management Systems Course Overview

This document provides information about a Database Management Systems course, including its objectives, prerequisites, modules, student learning outcomes, pedagogy, assessment, and references. The course aims to familiarize students with databases and their use. It covers topics such as the relational data model, SQL, database design, transaction processing, and new database applications.

Uploaded by

Tanmay McGrath
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)
53 views4 pages

Database Management Systems Course Overview

This document provides information about a Database Management Systems course, including its objectives, prerequisites, modules, student learning outcomes, pedagogy, assessment, and references. The course aims to familiarize students with databases and their use. It covers topics such as the relational data model, SQL, database design, transaction processing, and new database applications.

Uploaded by

Tanmay McGrath
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

Course Title: Database Management Systems

Credit Units: 5 L T P/ SW/F TOTAL


Course Level: UG S W CREDIT
Course Code: CSE201 UNITS
3 1 2 - 5

Course Objectives:
The objective of this course is to get students familiar with Databases and their use. They can identify different types of available database
model, concurrency techniques and new applications of the DBMS.

Pre-requisites:
Knowledge about the raw data, knowledge about the operating system and organization

Course Contents/Syllabus:
Weightage (%)
Module I : : Introduction 15%
Concept and goals of DBMS, Database Languages, Database Users, Database Abstraction. Database architecture,
The Relational Data Model and Relational Database Constraints, Basic Concepts of ER Mode l, Relationship sets,
Keys, Mapping, Design of ER Model
Module II: Relational Model 20%
The relational model , The catalog, Types, Keys, Relational algebra, Domain relational calculus, Tuple relational
calculus , Fundamental operations, Additional operations, SQL fundamentals, Integrity , Triggers , Views
,Relational database, Relational Algebra, Relational & Tuple Calculus

Module III : Relational Database Design 15%


Normalization using Functional Dependency, Multivalued dependency and Join depende ncy.

Module IV : Query Processing andOptimization, andDatabase Tuning 25%

Translating SQL Queries into RelationalAlgebra, Algorithms for External Sorting, Algorithms for SELECT and
JOINOperations, Algorithms for PROJECT and SetOperations, Combining Operations Using Pipelining, Using
Heuristics in Query Optimization

Module V: Transaction Processing,Concurre ncy Control, Recovery and ne w application 25%


Introduction to TransactionProcessing Conceptsand Theory, Lock Based Protocols, Time Stamped Based
Protocols, Deadlock Handling, Crash Recovery. Distributed Database, Objective Oriented Database, Multimedia
Database, Data Mining, Digital Libraries.

Student Learning Outcomes: After completion of this course student will be able to

 Apply knowledge of mathematics, science, engineering and computing appropriate to the discipline.
 Analyze a problem, and identify and define the computing requirements appropriate to its solution.
 Design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social,
political, ethical, health and safety, manufacturability, and sustainability
 Analyze the local and global impact of computing on individuals, organizations, and society.
 Recognize the need for and an ability to engage in continuing professional development.

Pedagogy for Course Delivery: PPT ,BLACKBOARD TEACHING


LAB

Course Contents:

1. Database Design
2. Data Definition (SQL)
3. Data Retrieval (SQL)
4. Data Modification (SQL)
5. Vie ws
6. Triggers and Procedures
7. PL\SQL

Assessment/ Examination Scheme:

Theory L/T (%) Lab/Practical/Studio (%) Total

80 20 100

Theory Assessment (L&T):


Continuous Assessment/Inte rnal Assessment End Term
Examination
Components (Drop Attendance Class Test Home Assignment Case Discussion
down)

Weightage (%) 5 10 7 8 70
Lab Assessment
Continuous Assessment/Inte rnal Assessment End Term
Examination
Components (Drop Attendance Lab Record Performance Viva
down)

Weightage (%) 5 10 10 5 70

Text & References:

Text Books:
1. Korth, Silberschatz, “Database System Concepts”, 6th Ed., TMH, 2011.
2. Steve Bobrowski, “Oracle & Architecture”, TMH, 2000

Reference Books:
1. Date C. J., “An Introduction to Database Systems”, 7th Ed., Narosa Publishing, 2004
2. Elmsari and Navathe, “Fundamentals of Database Systems”, 6th Ed., A. Wesley, 2010
3. Ullman J. D., “Principles of Database Systems”, 2 nd Ed., Galgotia Publications, 1999.

Common questions

Powered by AI

Normalization is essential in relational database design to reduce data redundancy and improve data integrity by organizing data into separate tables based on functional dependencies. The core benefits include minimizing insertion, update, and deletion anomalies, leading to more consistent and reliable data storage. It also simplifies the database structure, making it easier to maintain and query, ensuring data accuracy and consistency across the database.

Transactions and their properties—Atomicity, Consistency, Isolation, and Durability (ACID)—contribute to the robust functioning of a database system by ensuring reliability and data integrity. Atomicity guarantees all-or-nothing execution of transactions, preventing partial data updates. Consistency ensures that every transaction leaves the database in a valid state. Isolation prevents concurrent transactions from interfering with each other, and Durability ensures that once a transaction is committed, it remains so despite system failures. These properties collectively maintain system stability and data reliability.

The Entity-Relationship (ER) model facilitates effective database design by providing a comprehensive framework for understanding and representing the logical structure of data. It allows designers to visually map out entities, relationships, and attributes, helping to identify important entities and define relationships clearly. This visualization aids in creating a detailed blueprint for the database that can be translated into a physical schema, ensuring that all necessary data components and their interactions are considered.

External sorting plays a crucial role in query processing by efficiently managing large datasets that do not fit into main memory. It is necessary for database systems to handle sorting operations in such cases, ensuring that data can be processed in smaller blocks and reducing the need for excessive memory usage. This optimization is essential for executing sorting operations efficiently, impacting overall query performance positively by allowing large data volumes to be sorted quickly and accurately.

Heuristics improve the efficiency of query processing by guiding the optimizer to make decisions that reduce the cost of execution plans. Common heuristics include selecting the most restrictive filters early in the query plan to reduce the size of intermediate results, and using indexes to facilitate faster data retrieval operations. Heuristics can significantly reduce the search space for execution plans, leading to faster query performance by avoiding exhaustive searches of all possible plans.

Lock-based concurrency control protocols use locks to control access to data items during a transaction, ensuring that no other transactions can modify locked data until the lock is released. In contrast, timestamp-based protocols assign timestamps to each transaction, and the order of access to data items is determined based on these timestamps to ensure serialization. Lock-based protocols can suffer from deadlocks, whereas timestamp-based protocols avoid deadlocks but may experience higher overhead due to maintaining and checking timestamps.

SQL views offer several advantages in database management and data retrieval, including improved security by restricting access to specific data, simplifying complex queries by providing abstracted representations of table data, and enhancing maintainability by promoting reusability of SQL logic. They also allow for restructuring and summarizing large datasets to provide customized, user-friendly interfaces without altering the underlying data structure.

The key components of database architecture include the database engine, which handles storage and retrieval of data; database schemas, which define the logical structure of data; and the database management system (DBMS) interfaces, such as query languages and APIs, which allow users to interact with the system. These components are crucial for understanding how a DBMS functions because they collectively manage the organization, storage, manipulation, and retrieval of data in a structured manner, thereby ensuring data integrity and consistency across various applications.

Understanding different types of database users enhances the efficiency of a DBMS by allowing for tailored user interfaces, security measures, and functionalities to meet specific needs. For instance, administrators require broad access and control capabilities, while end-users might need simplified querying interfaces. By recognizing these roles, a DBMS can be optimized to ensure each user's tasks are performed efficiently, enhancing overall operational performance and user satisfaction.

Relational database constraints such as primary keys, foreign keys, and unique constraints enhance database integrity and consistency by ensuring that data is correctly related and not duplicated. Primary keys ensure that every record is unique, foreign keys maintain referential integrity by ensuring that relationships between tables are consistent, and unique constraints prevent duplication of values where they shouldn't occur. These constraints enforce rules on the data, which reduces errors and improves reliability.

You might also like