DATABASE

ANALYSIS
AND DESIGN
PRESENTED BY HSHSHSHSHS
WHAT IS A
DATABASE?
A database is an organized collection of data. It is
the collection of schemas, tables, queries,
reports, views, and other objects. The data are
typically organized to model aspects of reality in
a way that supports processes requiring
information, such as modeling the availability of
rooms in hotels in a way that supports finding a
hotel with vacancies.
data base is a collection of non-redundant data shareable
between different application systems. this term means that the
data should stored as a common pool shareable between
application systems.
Database analysis Concerned of establishing the
services that the customer requires from system and the
constraints under which it operates and is developed.
The requirements themselves are the description of the
system services and constraints that are generated .
Data analysis is concerned with the NATURE and USE of
data. It involves the identification of the data elements
which are needed to support the data processing system
of the organization, the placing of these elements into
logical groups and the definition of the relationships
between the resulting groups.
NORMALIZATION
TECHNIQUES
 NORMALIZATION
TECHNIQUES
Steps in
normalization
Insertion
anomaly

Deletion
Modification
anomaly
anomaly
INSERTION
ANOMALY
in DBMS
Suppose for a new admission, until and unless a student opts for a branch,
data of the student cannot be inserted, or else we will have to set the
branch information as NULL.

Also, if we have to insert data for 100 students of the same branch, then the
branch information will be repeated for all those 100 students.

These scenarios are nothing but Insertion anomalies.

If you have to repeat the same data in every row of data, it's better to keep
the data separately and reference that data in each row.

So in the above table, we can keep the branch information separately, and
just use the branch_id in the student table, where branch_id can be used to
get the branch information.
An insert anomaly arises when you cannot add
certain information to the database without
adding other unrelated information. For instance,
if you have a table designed to store information
about students and their courses, and if a
student has not yet enrolled in any courses, you
may face difficulties inserting data for that
student because of constraints within the
database schema.
UPDATE
ANOMALY
in DBMS

What if Mr. X leaves the college? or Mr. X is no longer the

HOD of the computer science department? In that case, all
the student records will have to be updated, and if by
mistake we miss any record, it will lead to data
inconsistency.

This is an Updation anomaly because you need to update all

the records in your table just because one piece of
information got changed.
 A modification anomaly occurs when updating
data in the database leads to inconsistencies. This
can happen if the same data is stored in multiple
places, and updating it in one place but not in
others causes data discrepancies. For example, if
you store a student's address in both the student
table and the course enrollment table, updating
the address in one place but not the other could
lead to inconsistencies.
DELETION
ANOMALY
in DBMS

In our Student table, two different pieces of information are

kept together, the Student information and the Branch
information.

So if only a single student is enrolled in a branch, and that

student leaves the college, or for some reason, the entry for
the student is deleted, we will lose the branch information
too.

So never in DBMS, we should keep two different entities

together, which in the above example is Student and branch,
A deletion anomaly happens when removing
certain data from the database results in
unintended loss of other related data. This
typically occurs when data that is not redundant is
stored in the same table. For example, if you store
information about courses along with information
about students in the same table, deleting a
student's record could inadvertently remove
information about the course they were enrolled
in.
RELATIONAL
DATABASE DEISGN
ALGORITHMS
Relational database design algorithms encompass a comprehensive set
of methodologies and techniques aimed at structuring and organizing
data within a relational database system optimally. These algorithms
guide the creation of database schemas, including entity-relationship
modeling, normalization to reduce redundancy, and data modeling to
define tables, columns, and relationships accurately.
Additionally, they address performance optimization through
indexing, query optimization, and storage optimization
techniques, while ensuring data integrity and consistency
through concurrency control and transaction management
algorithms. Backup and recovery strategies ensure data
availability and reliability. Collectively, these algorithms enable
the creation of well-designed, efficient, and scalable relational
database systems tailored to meet the specific requirements
of applications and users.
THANK
YOU VERY
MUCH!