CSC103 : Database

Management Systems
 About Course
• (Credits: Theory-04, Practicals-02)
• Theory : 60 Lectures
• Practicals : 60 Lectures
 Course Objectives
• Provide a strong foundation in database
concepts, technology, and practice.
• Practice SQL programming through a variety of
database problems.
• Understand the use of concurrency and
transactions in database
 Syllabus
• Introduction to Data Base Systems: File Systems versus a
DBMS, The Relational Model, Levels of abstraction in a
DBMS, Data independence, Queries in DBMS,
Concurrent Access and Crash Recovery, Structure of
DBMS, Advantage of DBMS, People who deal with
Databases.
• Conceptual design and Entity Relationship model:
Overview of Data Base Design, The ER model-features,
Key Constraints, Participation Constraints, weak Entities,
Class Hierarchies, Aggregation, Entity versus attribute,
Entity versus relationship, Binary versus ternary
relationship, aggregation versus ternary relationships.
• The Relational Model: Attributes and domains, Relations,
Integrity Constraints, Key Constraints, Foreign Key
Constraints, General Constraints, Enforcing Integrity
constraints.
• Logical Database design ER to relational : Entity sets to
tables, Relationship sets (without constraints) to tables,
translating relationship sets with key constraints,
translating relationship sets with participation
constraints, translating weak entity sets, translating class
hierarchies, translating ER diagrams with aggregation.
• Schema Refinement and Normal forms: Introduction,
Why Schema Refinement? Functional Dependencies,
Normal Forms: BCNF, Third Normal Form, Normalisation-
Decomposition up to BCNF
• Relational Algebra: Relational algebra operations- select,
project, join, natural join, equijoin and their implementation.
• SQL: The Form of Basic SQL query, Condition specification,
SQL Joins, Outer joins, Union, Intersect, Except, Nested
queries, Aggregate Operators, Null values.
• SQL: Embedded SQL, Cursors, Dynamic SQL, Triggers and
active databases
• Transaction management : The concept and properties of
transaction, transaction and schedule, Notion of consistency,
Serializability, Isolation levels, Lock based concurrency
control, concurrency control without locking, deadlocks
• Crash Recovery: Introduction to crash recovery, Recovery and
atomicity, Log based recovery, Shadow paging.
 Books
Text Book :
• Abraham Silberschatz, Henry F. Korth, S. Sudarshan,
“Database System Concepts”, McGraw Hill Education,
6th Edition.
Reference Books :
• Ramez Elmasri, Shamkant B. Navathe, “Fundamentals
of Database Systems”, Pearson Education, 7th Edition
• Raghu Ramakrishnan, Johannes Gehrke, “Database
Management Systems”, McGraw Hill Education, 3rd
Edition.
 Introduction to Data Base Systems
• DBMS contains information about a particular enterprise
– Collection of interrelated data
– Set of programs to access the data
– An environment that is both convenient and efficient to use
• Database Applications:
– Banking: all transactions
– Airlines: reservations, schedules
– Universities: registration, grades
– Sales: customers, products, purchases
– Online retailers: order tracking, customized recommendations
– Manufacturing: production, inventory, orders, supply chain
– Human resources: employee records, salaries, tax deductions
• Databases touch all aspects of our lives
 File System v/s DBMS
• In the early days, database applications were built directly
on top of file systems
• Drawbacks of using file systems to store data:
– Data redundancy and inconsistency
• Multiple file formats, duplication of information in different files
– Difficulty in accessing data
• Need to write a new program to carry out each new task
– Data isolation — multiple files and formats
– Integrity problems
• Integrity constraints (e.g. account balance > 0) become “buried” in
program code rather than being stated explicitly
• Hard to add new constraints or change existing ones
• Drawbacks of using file systems (cont.)
– Atomicity of updates
• Failures may leave database in an inconsistent state with partial
updates carried out
• Example: Transfer of funds from one account to another should
either complete or not happen at all
– Concurrent access by multiple users
• Concurrent accessed needed for performance
• Uncontrolled concurrent accesses can lead to inconsistencies
– Example: Two people reading a balance and updating it at the same
time
– Security problems
• Hard to provide user access to some, but not all, data
• Database systems offer solutions to all the above
problems
 Levels of Abstraction
• Physical level: describes how a record (e.g., customer) is stored.
• Logical level: describes data stored in database, and the
relationships among the data.
type customer = record
customer_id : string;
customer_name : string;
customer_street : string;
customer_city : string;
end;

• View level: application programs hide details of data types.

Views can also hide information (such as an employee’s salary)
for security purposes.
 View of Data
• An architecture for a database system
 Instances and Schemas
• Similar to types and variables in programming languages
• Schema – the logical structure of the database
– Example: The database consists of information about a set of customers
and accounts and the relationship between them.
– Analogous to type information of a variable in a program
– Physical schema: database design at the physical level
– Logical schema: database design at the logical level
• Instance – the actual content of the database at a particular point in time
– Analogous to the value of a variable
• Physical Data Independence – the ability to modify the physical schema
without changing the logical schema
– Applications depend on the logical schema
– In general, the interfaces between the various levels and components
should be well defined so that changes in some parts do not seriously
influence others
 Data Models
• A collection of tools for describing
– Data
– Data relationships
– Data semantics
– Data constraints
• Relational model
• Entity-Relationship data model (mainly for database design)
• Object-based data models (Object-oriented and Object-
relational)
• Semistructured data model (XML)
• Other older models:
– Network model
– Hierarchical model
Data Manipulation Language (DML)
• Language for accessing and manipulating the data
organized by the appropriate data model
– DML also known as query language
• Two classes of languages
– Procedural – user specifies what data is required and
how to get those data
– Declarative (nonprocedural) – user specifies what data
is required without specifying how to get those data
• SQL is the most widely used query language
 Data Definition Language (DDL)
• Specification notation for defining the database schema
Example: create table account (
account_number char(10),
branch_name char(10),
balance integer)
• DDL compiler generates a set of tables stored in a data dictionary
• Data dictionary contains metadata (i.e., data about data)
– Database schema
– Data storage and definition language
• Specifies the storage structure and access methods used
– Integrity constraints
• Domain constraints
• Referential integrity (e.g. branch_name must correspond to a valid branch in the
branch table)
– Authorization
 Relational Model
• Example of tabular data in the relational model
A Sample Relational Database
 Queries in Database
• A query is a request for data or information from a
database table or combination of tables.
• This data may be generated as results returned by
Structured Query Language (SQL) or as pictorials, graphs or
complex results, e.g., trend analyses from data-mining
tools.
• One of several different query languages may be used to
perform a range of simple to complex database queries.
• SQL, the most well-known and widely-used query
language, is familiar to most database administrators
(DBAs).
 Concurrent Access and Crash Recovery
• A DBMS supports the notion of a transaction, which is conceptually a single user’s
sequential program.
• Users can write transactions as if their programs were running in isolation against the
database.
• The DBMS executes the actions of transactions in an interleaved fashion to obtain good
performance, but schedules them in such a way as to ensure that conflicting operations
are not permitted to proceed concurrently.
• Further, the DBMS maintains a continuous log of the changes to the data, and if there is
a system crash, it can restore the database to a transaction-consistent state.
• That is, the actions of incomplete transactions are undone, so that the database state
reflects only the actions of completed transactions.
• Thus, if each complete transaction, executing alone, maintains the consistency criteria,
then the database state after recovery from a crash is consistent.
• Transaction-management component ensures that the database remains in a consistent
(correct) state despite system failures (e.g., power failures and operating system
crashes) and transaction failures.
• Concurrency-control manager controls the interaction among the concurrent
transactions, to ensure the consistency of the database.
 Database Users
Users are differentiated by the way they expect to interact with
the system
• Application programmers – interact with system through DML
calls
• Sophisticated users – form requests in a database query
language
• Specialized users – write specialized database applications
that do not fit into the traditional data processing framework
• Naïve users – invoke one of the permanent application
programs that have been written previously
– Examples, people accessing database over the web, bank tellers,
clerical staff
 Database Administrator
• Coordinates all the activities of the database system
– has a good understanding of the enterprise’s information
resources and needs.
• Database administrator's duties include:
– Storage structure and access method definition
– Schema and physical organization modification
– Granting users authority to access the database
– Backing up data
– Monitoring performance and responding to changes
• Database tuning
 Advantages of DBMS
• There are several advantages of Database management
system over file system. Few of them are as follows:
– No redundant data – Redundancy removed by data
normalization
– Data Consistency and Integrity – data normalization takes care
of it too
– Secure – Each user has a different set of access
– Privacy – Limited access
– Easy access to data
– Easy recovery
– Flexible
Structure of DBMS