0% found this document useful (0 votes)
59 views

3 - DBMS

The document discusses different types of database management systems including hierarchical (HDBMS), network (NDBMS), relational (RDBMS), and object-oriented (OODBMS). It provides details on each type, including defining characteristics, examples, advantages, and disadvantages. The key points made are that HDBMS and NDBMS allow hierarchical and network relationships between data respectively, RDBMS allows flexible querying through tables connected by key fields, and OODBMS integrates databases with object-oriented programming.

Uploaded by

cyka blyat
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
59 views

3 - DBMS

The document discusses different types of database management systems including hierarchical (HDBMS), network (NDBMS), relational (RDBMS), and object-oriented (OODBMS). It provides details on each type, including defining characteristics, examples, advantages, and disadvantages. The key points made are that HDBMS and NDBMS allow hierarchical and network relationships between data respectively, RDBMS allows flexible querying through tables connected by key fields, and OODBMS integrates databases with object-oriented programming.

Uploaded by

cyka blyat
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

DATABASE MANAGEMENT SYSTEMS

• DBMS (Data Schemas)


• HDBMS (Hierarchical Database Management System)
• NDBMS (Network Database Management System)
• RDBMS (Relational Database Management System)
• OODBMS (Object oriented Database Management System)
3.1 DBMS- Data Base Management System

Database is collection of data which is related by some aspect. Data is collection of facts and figures
which can be processed to produce information. Name of a student, age, class and her subjects can be
counted as data for recording purposes.

Mostly data represents recordable facts. Data aids in producing information which is based on facts.
For example, if we have data about marks obtained by all students, we can then conclude about
toppers and average marks etc.

A database management system stores data, in such a way which is easier to retrieve, manipulate and
helps to produce information.
3.1.7 DBMS - Data Schemas

Database schema skeleton structure of and it represents the logical view of entire database. It tells about how
the data is organized and how relation among them is associated. It formulates all database constraints that
would be put on data in relations, which resides in database.

A database schema defines its entities and the relationship among them. Database schema is a
descriptive detail of the database, which can be depicted by means of schema diagrams. All these activities
are done by database designer to help programmers in order to give some ease of understanding all aspect of
database.

Database schema can be divided broadly in two categories:

 Physical Database Schema: This schema pertains to the actual storage of data and its form of storage like
files, indices etc. It defines the how data will be stored in secondary storage etc.

 Logical Database Schema: This defines all logical constraints that need to be applied on data stored. It
defines tables, views and integrity constraints etc.
3.1.7.2 Database Instance

It is important that we distinguish these two terms individually. Database schema is the skeleton of
database.

It is designed when database doesn't exist at all and very hard to do any changes once the database is
operational. Database schema does not contain any data or information.

Database instances, is a state of operational database with data at any given time. This is a snapshot of
database. Database instances tend to change with time. DBMS ensures that its every instance (state) must
be a valid state by keeping up to all validation, constraints and condition that database designers
has imposed or it is expected from DBMS itself.
3.2 HDBMS (Hierarchical Database Management System)

A hierarchical database model is a data model in which the data is organized into a tree-like structure.

The data is stored as records which are connected to one another through links. A record is a collection of
fields, with each field containing only one value. The entity type of a record defines which fields the record
contains.
3.2.1 Example of a hierarchical model

A record in the hierarchical database model corresponds to a row in the relational database model and
an entity type corresponds to a table.

The hierarchical database model mandates that each child record has only one parent, whereas each parent
record can have one or more child records. In order to retrieve data from a hierarchical database the whole
tree needs to be traversed starting from the root node. This model is recognized as the first database model
created by IBM in the 1960s.

The Hierarchical Data Model is a way of organizing a database with multiple one to many relationships. The
structure is based on the rule that one parent can have many children but children are allowed only one
parent. This structure allows information to be repeated through the parent child relations created by IBM and
was implemented mainly in their Information Management System.
.2.1 Example of a hierarchical model
3.2.2 Advantages

The model allows easy addition and deletion of new information. Data at the top of the Hierarchy is very
fast to access. It was very easy to work with the model because it worked well with linear type data storage
such as tapes. The model relates very well to natural hierarchies such as assembly plants and employee
organization in corporations. It relates well to anything that works through a one to many relationships. For
example; there is a president with many managers below them, and those managers have many
employees below them, but each employee has only one manager.

3.2.3 Disadvantages

This model has many issues that hold it back now that we require more sophisticated relationships. It
requires data to be repetitively stored in many different entities. The database can be very slow when
searching for information on the lower entities. We no longer use linear data storage mediums such as
tapes so that advantage is null. Searching for data requires the DBMS to run through the entire model from
top to bottom until the required information is found, making queries very slow. Can only model one to
many relationships, many to many relationships are not supported. Clever manipulation of the model is
required to make many to may relationships.
3.3 NDBMS-Network Database Management System

Network Database: A network databases are mainly used on large digital computers. It more connections
can be made between different types of data, network databases are considered more efficiency It contains
limitations must be considered when we have to use this kind of database. It is Similar to the hierarchical
databases; network databases.

Network databases are similar to hierarchical databases by also having a hierarchical structure. A network
database looks more like a cobweb or interconnected network of records. In network databases, children are
called members and parents are called occupier. The difference between each child or member can have
more than one parent. The Approval of the network data model similar with the esteem of the hierarchical
data model. Some data were more naturally modeled with more than one parent per child. The network
model authorized the modeling of many-to-many relationships in data.

The network model is very similar to the hierarchical model really. Actually the hierarchical model is a subset
of the network model. However, instead of using a single-parent tree hierarchy, the network model uses set
theory to provide a tree-like hierarchy with the exception that child tables were allowed to have more than
one parent. It supports many-to-many relationships.
3.4 RDBMS-Relational Database Management System

In relational databases, the relationship between data files is relational. Hierarchical and network databases
require the user to pass a hierarchy in order to access needed data. These databases connect to the data
in different files by using common data numbers or a key field. Data in relational databases is stored in
different access control tables, each having a key field that mainly identifies each row. In the relational
databases are more reliable than either the hierarchical or network database structures. In relational
databases, tables or files filled up with data are called relations designates a row or record, and columns
are referred to as attributes or fields.

Relational databases work on each table has a key field that uniquely indicates each row, and that these
key fields can be used to connect one table of data to another.
3.4.1 The relational database has two major reasons

1. Relational databases can be used with little or no training.


2. Database entries can be modified without specify the entire body.

3.4.2 Properties of Relational Tables


In the relational database we have to follow some properties which are given below.

• It's Values are Atomic


• In Each Row is alone
• Column Values are of the same thing.
• Columns are undistinguished.
• Sequence of Rows is Insignificant.
• Each Column has a common Name.
3.5 OODBMS – Object oriented Database Management System

In this Model we have to discuss the functionality of the object oriented Programming .It takes more than
storage of programming language objects. Object DBMS's increase the semantics of the C++ and Java .It
provides full-featured database programming capability, while containing native language compatibility. It
adds the database functionality to object programming languages. This approach is the analogical of the
application and database development into a constant data model and language environment. Applications
require less code, use more natural data modeling, and code bases are easier to maintain. Object
developers can write complete database applications with a decent amount of additional effort.

The object-oriented database derivation is the integrity of object-oriented programming language systems
and consistent systems. The power of the object-oriented databases comes from the cyclical treatment of
both consistent data, as found in databases, and transient data, as found in executing programs.

Object-oriented databases use small, recyclable separated of software called objects. The objects
themselves are stored in the object-oriented database. Each object contains of two elements:

1. Piece of data (e.g., sound, video, text, or graphics).


2. Instructions or software programs called methods, for what to do with the data.
3.5.1 Disadvantage of Object-oriented databases

1. Object-oriented databases have these disadvantages.


2. Object-oriented database are more expensive to develop.
3. In the Most organizations are unwilling to abandon and convert from those databases.

The benefits to object-oriented databases are compelling. The ability to mix and match reusable objects
provides incredible multimedia capability

You might also like