Skip to main content

Database and DBMS

Database:
 It is a collection of related data that contains information about one particular enterprise.

DBMS (Database Management System): It is a software system that allows data contained in a database. The objective of DBMS is to provide an easy method of defining, storing and retrieving information contained in database.
Characteristics of database approach:
In the database approach a single repository of data is maintained that is define once and then accessed by various users. In file systems, each application is free to name that are elements independently. In contrast in a database the names or levels of data define once and used used repeatedly by queries, transactions, applications. The main characteristics of database approach versus the file processing approach are the following:

  • Self describing nature of a database system
  • Insulation between programs and data, data abstraction
  • Support of multiple views of the data
  • Sharing of data and multi user transaction processing.

Advantages of DBMS:
1) Reduction of data redundancy ( data redundancy means duplication of data)
2) Sharing of data
3) Integrity ( integrity means data quality enhanced)
4) Security
5) Data independence : we see this from two point of view;
a) physical data independence
b) logical data independence

Disadvantages of DBMS
DBMS has main three disadvantages:

1) Problem associated with centralisation
2) Cost of software/hardware and migration
3) Complexity of back up and recovery

Structure of DBMS: 
 The major components of the DBMS are:
1) Data definition language compiler (DDL)
2) Data Manager
3) File Manager
4) Disk Manager
5) Query processor
6) Database Abstraction: The data is abstracted in three levels:
  • External View 
  • Conceptual or Global View
  • InternalView
The three-schema architecture of DBMS:
1.) Internal level: The internal level has an internal schema which describe the physical storage structure of the database. The internal schema uses a physical data model and describes the complete details of data storage and access paths for the database.

2.) Conceptual Level: The conceptual level has a conceptual schema, which describes the structure of the whole database for a community of users. The conceptual schema hide the detail of physical storage structures and concentrate on describing entities, data types, relationships, user operations and constraints.

3.) External Level: The external view or level includes a number of external schemas or user views. Each external schema describes the part of the database that a particular user group is interested in and hides the rest of the database from that user group.










Comments

Popular posts from this blog

Hub, repeater, switch, router, gateway, bridge

HUB Hub is a controller that controls the traffic on the network.  The following important properties of hub are:  1) It amplify signals. 2) It propagates signals through the network. 3) It does not require filtering. 4) It does not require path determination for switching. 5) It is used as network concentration points. Hubs are basically two types: 1) Active hub 2) Passive hub Active hub: A ctive hub works as repeater which is a hardware device that regenerates the received bit pattern before sending them out . Passive hub : A passive hub is a simple hardware device which provide a simple physical connection between the attached devices. Advantages of hub: It cannot filter the traffic full stop feeling generally refers to a process or device that screens network traffic for certain characteristics such as source address and destination address and protocol. Disadvantages of hub: On a hub, more than one user may try to send data on the network at sam

Scheduling: preemptive scheduling

Preemptive Scheduling : In contrast to non preemptive scheduling, a scheduling decision can be made even while the job is executing whereas in non preemptive scheduling, a scheduling decision is made only after job completes its execution. Therefor preemptive scheduling may force a job in execution to release the processor, so that the execution of some other job can be undertaken, in order to improve throughput considerably. Types of preemptive scheduling: 1) Round Robin scheduling algorithm : the round Robin scheduling is designed for time sharing systems. The primary objective of round Robin scheduling are interactive use, good response time and sharing the resources equitable among processes. It is similar to FCFS, but preemption is added to switch between processes. The processes are alocated a small unit of time. Known as time Quantum or time slice is in rotation until the completion of processes. To implement round Robin scheduling, a FIFO(first in first out) queue

Scheduling: Non-Preemptive Scheduling

Scheduling : In multi-programmed computer, multiple processes competing for the CPU at the same time. This situation occurs whenever two or more processes are simultaneously in the ready state. If only one CPU is available. Then we need a system that decide which process run first and then next and this will be done by the scheduler. Scheduler : scheduler is an operating system module that she loves an axe top to be admitted into the system and then the next process to run. Scheduling is of two type: 1) Pre-emptive 2) Non pre-emptive Non Pre-emptive Scheduling : In batch non Pre-emptive scheduling implies that, once scheduled, selected job runs to completion. In other words, the running process not forced to relinquish ownership of the processor when a higher priority process becomes ready for execution. The scheduling techniques which use non preemptive scheduling are: 1) first come first serve (FCFS) scheduling 2) shortest job next (SJN) scheduling 3) dea