Anda di halaman 1dari 36

DATABASE MANAGEMENT SYSTEM DBMS

DATABASE MANAGEMENT SYSTEM DBMS Jamia Millia Islamia MD NASIR mdnasir4u@gmail.com

Jamia Millia Islamia

MD NASIR

mdnasir4u@gmail.com

Overview

A DBMS is a set of Software programs that controls the organization, storage, management, and retrieval of data in a database. DBMSs are categorized according to their data structures or types. The DBMS accepts requests for data from an application program and instructs the operating system to transfer the appropriate data. The queries and responses must be submitted and received according to a format that conforms to one or more applicable protocols. When a DBMS is used, information systems can be changed much more easily as the organization's information requirements change. New categories of data can be added to the database without disruption to the existing system.

Database servers are computers that hold the actual databases and run only the DBMS and related software. Database servers are usually multiprocessor computers, with generous memory and RAID disk arrays used for stable storage. Hardware database accelerators, connected to one or more servers via a high-speed channel, are also used in large volume transaction processing environments. DBMSs are found at the heart of most database applications. DBMSs may be built around a custom multitasking kernel with built-in networking support, but modern DBMSs typically rely on a standard operating system to provide these functions

Database Management System (DBMS)

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

Purpose of Database Systems

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

Purpose of Database Systems (Cont.)

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

View of Data An architecture for a database system

Component of DBMS

* DBMS Engine accepts logical request from the various other DBMS subsystems, converts them into physical equivalents, and actually accesses the database and data dictionary as they exist on a storage device.

* Data Definition Subsystem helps user to create and maintain the data dictionary and define the structure of the files in a database.

* Data Manipulation Subsystem helps user to add, change, and delete information in a database and query it for valuable information. Software tools within the data manipulation subsystem are most often the primary interface between user and the information contained in a database. It allows user to specify its logical information requirements.

* Application Generation Subsystem contains facilities to help users to develop transaction-intensive applications. It usually requires that user perform a detailed series of tasks to process a transaction. It facilitates easy-to-use data entry screens, programming languages, and interfaces.

* Data Administration Subsystem helps users to manage the overall database environment by providing facilities for backup and recovery, security management, query optimization, concurrency control, and change management.

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

branch_name

balance

char(10),

char(10),

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

Attributes

Relational Model Attributes  Example of tabular data in the relational model

Example of tabular data in the relational model

Relational Model Attributes  Example of tabular data in the relational model

A Sample Relational Database

A Sample Relational Database

Structured Query Language (SQL)

SQL: widely used non-procedural language

Example: Find the name of the customer with customer-id 192-83-

7465

select customer.customer_name from customer where customer.customer_id = ‘192-83-7465’

Example: Find the balances of all accounts held by the customer with customer-id 192-83-7465 select account.balance

from

depositor, account

where

depositor.customer_id = ‘192-83-7465’ and

depositor.account_number = account.account_number Application programs generally access databases through one of Language extensions to allow embedded SQL

Application program interface (e.g., ODBC/JDBC) which allow SQL queries to be sent to a database

Database Design

The process of designing the general structure of the database:

Logical Design – Deciding on the database schema. Database design requires that we find a “good” collection of relation schemas. Business decision – What attributes should we record in the database?

Computer Science decision – What relation schemas should we have and how should the attributes be distributed among the various relation schemas?

Physical Design – Deciding on the physical layout of the database

The Entity-Relationship Model

Models an enterprise as a collection of entities and relationships

Entity: a “thing” or “object” in the enterprise that is distinguishable from other objects

Described by a set of attributes Relationship: an association among several entities Represented diagrammatically by an entity-relationship diagram:

The Entity-Relationship Model  Models an enterprise as a collection of entities and relationships  Entity:

Database Application Architectures

(web browser)
(web browser)

Old

Modern

Storage Management

Storage manager is a program module that provides the interface between the low-level data stored in the database and the application programs and queries submitted to the system.

The storage manager is responsible to the following tasks:

Interaction with the file manager Efficient storing, retrieving and updating of data Issues:

Storage access File organization Indexing and hashing

Query Processing

  • 1. Parsing and translation

  • 2. Optimization

  • 3. Evaluation

Query Processing 1. Parsing and translation 2. Optimization 3. Evaluation

Query Processing (Cont.)

Alternative ways of evaluating a given query Equivalent expressions Different algorithms for each operation

Cost difference between a good and a bad way of evaluating a query can be enormous

Need to estimate the cost of operations

Depends critically on statistical information about relations which the database must maintain

Need to estimate statistics for intermediate results to compute cost of complex expressions

Transaction Management

A transaction is a collection of operations that performs a single logical function in a database application

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.

Transaction Concept

A transaction is a unit of program execution that accesses and possibly updates various data items.

E.g. transaction to transfer $50 from account A to account B:

  • 1. read(A)

  • 2. A := A – 50

  • 3. write(A)

  • 4. read(B)

  • 5. B := B + 50

  • 6. write(B)

Two main issues to deal with:

Failures of various kinds, such as hardware failures and system crashes Concurrent execution of multiple transactions

ACID Properties

A transaction is a unit of program execution that accesses and possibly updates various data items. To preserve the integrity of data the database system must ensure:

Atomicity. Either all operations of the transaction are properly reflected in the database or none are.

Consistency. Execution of a transaction in isolation preserves the consistency of the database.

Isolation. Although multiple transactions may execute concurrently, each transaction must be unaware of other concurrently executing transactions. Intermediate transaction results must be hidden from other concurrently executed transactions.

That is, for every pair of transactions T i and T j , it appears to T i that either T j , finished execution before T i started, or T j started execution after T i finished.

Durability. After a transaction completes successfully, the changes it has made to the database persist, even if there are system failures.

Transaction State

Active – the initial state; the transaction stays in this state while it is executing

Partially committed – after the final statement has been executed. Failed -- after the discovery that normal execution can no longer proceed.

Aborted – after the transaction has been rolled back and the database restored to its state prior to the start of the transaction. Two options after it has been aborted:

restart the transaction

can be done only if no internal logical error

kill the transaction

Committed – after successful completion.

Transaction State

Transaction State

Concurrent Executions

Multiple transactions are allowed to run concurrently in the system. Advantages are:

increased processor and disk utilization, leading to better transaction throughput

E.g. one transaction can be using the CPU while another is reading from or writing to the disk

reduced average response time for transactions: short transactions need not wait behind long ones. Concurrency control schemes – mechanisms to achieve isolation

that is, to control the interaction among the concurrent transactions in order to prevent them from destroying the consistency of the database

Will study in Chapter 16, after studying notion of correctness of concurrent executions.

Serializability

Basic Assumption – Each transaction preserves database consistency. Thus serial execution of a set of transactions preserves database consistency.

A (possibly concurrent) schedule is serializable if it is equivalent to a serial schedule. Different forms of schedule equivalence give rise to the notions of:

  • 1. conflict serializability

  • 2. view serializability

Simplified view of transactions We ignore operations other than read and write instructions

We assume that transactions may perform arbitrary computations on data in local buffers in between reads and writes.

Our simplified schedules consist of only read and write instructions.

Recoverable Schedules

Recoverable schedule — if a transaction T j reads a data item previously written by a transaction T i , then the commit operation of T i appears before the commit operation of T j .

The following schedule (Schedule 11) is not recoverable if T 9 commits

immediately after the

read

Recoverable Schedules    Recoverable schedule — if a transaction T reads a data item

If T 8 should abort, T 9 would have read (and possibly shown to the user) an inconsistent database state. Hence, database must ensure that schedules are recoverable.

Recoverable

Schedules(cont )

..

Cascading rollback – a single transaction failure leads to a series of transaction rollbacks. Consider the following schedule where none of the transactions has yet committed (so the schedule is recoverable)

Recoverable Schedules(cont ) ..  Cascading rollback – a single transaction failure leads to a series

If T 10 fails, T 11 and T 12 must also be rolled back. Can lead to the undoing of a significant amount of work

Cascadeless schedules — cascading rollbacks cannot occur; for each pair of transactions T i and T j such that T j reads a data item previously written by T i , the

commit operation of T i appears before the read operation of T j . Every cascadeless schedule is also recoverable It is desirable to restrict the schedules to those that are cascadeless

Concurrency Control

A database must provide a mechanism that will ensure that all possible schedules are

either conflict or view serializable, and are recoverable and preferably cascadeless

A policy in which only one transaction can execute at a time generates serial schedules, but provides a poor degree of concurrency

Are serial schedules recoverable/cascadeless?

Testing a schedule for serializability after it has executed is a little too late!

Goal – to develop concurrency control protocols that will assure serializability.

Levels of Consistency

Serializable — default

Repeatable read — only committed records to be read, repeated reads of same record must return same value. However, a transaction may not be serializable – it may find some records inserted by a transaction but not find others.

Read committed — only committed records can be read, but successive reads of record may return different (but committed) values.

Read uncommitted — even uncommitted records may be read.

Lower degrees of consistency useful for gathering approximate information about the database

Warning: some database systems do not ensure serializable schedules by default

E.g. Oracle and PostgreSQL by default support a level of consistency called snapshot isolation (not part of the SQL standard)

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

List of DBMS Software

List of DBMS Software IBM DB2 PostgreSQL MS Access
List of DBMS Software IBM DB2 PostgreSQL MS Access
List of DBMS Software IBM DB2 PostgreSQL MS Access

IBM DB2

List of DBMS Software IBM DB2 PostgreSQL MS Access

PostgreSQL

List of DBMS Software IBM DB2 PostgreSQL MS Access

MS Access

List of DBMS Software IBM DB2 PostgreSQL MS Access
List of DBMS Software IBM DB2 PostgreSQL MS Access
List of DBMS Software IBM DB2 PostgreSQL MS Access

THANK YOU