CHINHOYI UNIVERSITY OF TECHNOLOGY

GRADUATE BUSINESS SCHOOL

MASTER OF SCIENCE IN DATA ANALYTICS

DATA BASE MANAGEMENT MSCDA 623

PRESENTATION BY

• Tinashe Chitsike C22153265S

• Munyaradzi Tembo C22153358D
• Chido Mlambo C22153485H
• Bridget Manyinyire C22153318N
• Wayne Mhishi C22153191D
• Exalt Pawarikanda C22153287O
• Mabel Katso C22153286L
• Erasmus Gwidza C22153350P
• Bheki Mpofu C22153413M
• Shumirai Manzvera C15125641A
 Database Environment
OUTLINE

 The Three-Level ANSI-SPARC

architecture

 Data models

 Types of Database Management System

 Components of a DBMS, Anatomy of a

DBMS (organizational diagram)

 Common Mistakes in the Design of

Databases
 Introduction

 A database environment is a system of components that regulate the collection, management and
use of data. 

 It includes software, hardware, people, procedures and the data itself.

ANSI-SPARC Stands for American National Standards Institute (ANSI)-Standards Planning and
Requirements Committee (SPARC)

ATTRIBUTES OF THE THREE LEVEL ANSI-SPARC

ABSTRACTION:
• The three-schema architecture divides the database into three-level used to create a separation
between the physical database and the user application. In simple terms, this architecture hides the
details of physical storage from the user and this is known as abstraction.
• The process to convert a request (from an external level) and the result between view levels is
called mapping
INDEPENDENCE:
Data independence in DBMS means the ability to change a schema to one level without affecting the other
schemas. It is when the schema is changed at some level, the schema at the next higher level remains
unchanged but only the mapping between the two levels is changed. There are two types of data
independence namely logical data independence and physical data independence.
• Logical data independence is the ability to change the conceptual schema without having to change
external schemas.
• Physical data independence is the ability to change the internal schema without having to change the
conceptual schema.
 The Three-Level ANSI-SPARC
architecture
EXTERNAL LEVEL

 External Level: It describes only part of the entire database that the end user is concerned. It is
also known as view level. End users need to access only part of the database rather than entire
View 1 View 3
View 2 database. Different user need different views of database. And so, there can be many view level
abstractions of the same database.

 Conceptual Level: It describes What data are stored in the database and What relationships exist
among those data. It is also known as Logical level. It hides low level complexities of physical
CONCEPTUAL LEVEL storage. Database administrator and designers work at this level to determine What data to keep
in database. Application developers also work on this level.

INTERNAL LEVEL
 Internal Level: It describes How the data are actually stored on storage devices. It is also known
as physical level and It provides internal view of physical storage of data. It deals with complex
low level data structures, file structures and access methods in detail. It also deals with Data
Compression and Encryption techniques if used.
 Data Models

 A data model is a conceptual way to structure data. It is a method

Relational
employed to structure data.
Model
 Data models are primary artifacts through which an organization
represents its data to itself and through which it understands its data.
Semi- Entity-
(Danette McGilvray 2021)
Structured Relationsh
 Data models define how data is connected to each other and how they Model ip Model
are processed and stored inside the system.
 They provide a way to represent the relationships between different
Types of Data Models
data entities and constraints on the data.
 A data model decides the method of storing and organising the data in
the database. Object-
Hierarchic
Based
 Data models are designed based on rules and concepts and are used to al Model
Model
design databases
 The Network and Hierarchical Models are outdated.
Network
Model
 Relational Model
 This is a collection of tables which represent both data and Table Name
relationships
Column Name
Students Information
 Objects are stored in the table as rows (tuples) First Name Surname Student Phone
Number Number
 Attributes are the columns or fields which contain each
John White C000001 077177277 Tuple/ Row
item
Rutendo Bhema C000002 078577111
 Every relation expressed in a two-dimensional table
 This model was initially described by Edgar F. Codd, in
1969. Attribute / Column
 The Relational Data Model is the most widely used model. Table / Relation
 Entity-Relationship Model
 Known as the E-R Model and is widely used to design
databases
 It is a way of graphically representing the logical
relationship of entities or objects to create a database Entity Attribute Relationship
 Entity is a real life object which means each object is
distinguishable from other objects eg person, house, place, Example
job, course, etc St. St. Uni. Uni.
St. ID phone ID Name
Name
 Entities linked to each other through relationships
 Various relationships exist as follows:
 One to one Student Studying University
 One to many
 Many to one
 Many to many
Teaches Lecturer Employs

Lec. Lec.
ID Name
 Hierarchical Model
 Assumes that every data relationship can be Example
represented in hierarchies

University
 Data elements are organised in a tree like structure
where highest level of the tree is the root node

Department Infrastructure
 Upper node is connected to a lower node in a
parent-child relationship. First database was based
on the hierarchical model

 Each entity has one parent and many children Course Lecturers Students Hostels ICT

 Relationship between the various layers is

logically simple
Theory Practical
 Network Model
 Builds on the Hierarchical Mode; and allows many- A
to-many relationships. There can be more than one
parent node
 Can represent more complex data relationships which B1 B2
makes it easier and faster to access data
 Data represented in a graph like structure rather than
tree-like as in a hierarchical model C1 C2 C3
 In the example the child node Student has two parent
nodes
Example
Department

Course Lecturer

Student
 Object-based(/Orientated)
Model
 An extension of the E-R Model
Object 1: Student Object 2: Course
 Both data and relationship are contained in a single structure
called an object
Data:
Data:
• ID
 In object based data models, the focus is on how data is • Course ID
represented. The data is divided into multiple entities each of • Name
• Course Name
which have some defining characteristics. Moreover, these • Courses
data entities are connected with each other through some
relationships.
Methods (Used to Methods (Used to
 Can store audio, video, pictures and other data types which perform operations on perform operations on
cannot be stored in relations/ tables data): data):
• Get Marks • Get Marks
• Get Attendance • Add Marks
 Represents real world challenges better. There is not as much
concern over what the data is as compared to how it is
visualised and connected.
 Semi-structured Data Model

 An evolution of the relational data model and allows representation of data with a flexible structure e.g. some
entities may have missing attributes or extra attributes

 This model is used to transfer data among two application and the language that support the semistructured data
model is the Extensible Markup Language, also known as XML

 Main disadvantage is that queries cannot be performed quickly due to limited structure
 Components of a DBMS, Anatomy of a
DBMS (organizational diagram)

 DBMS is a type of software by which we can save,

retrieve the user’s data with security measures.

 There are many components available in a DBMS and

each component has a significant task.
 Components of a DBMS, Anatomy of
a DBMS (organizational diagram)…cont

 Procedure : instructions used in a database management system.

These include everything from setup and installation through login
and logout, managing day-to-day operations, taking data backups,
and generating reports. (Gehrke, Johannes 2016)

 Hardware : refers to physical part of the DBMS (such as monitors

and hard drives) that act as a connection between DBMS and real-
world systems.

 Software: (main component) is a group of programs used to

administer and manage the database. It comprises the database
software, operating system, network software and applications
software. e.g. MySQL, Oracle
 Components of a DBMS, Anatomy of
a DBMS (organizational diagram)…cont

 Data : Data are unprocessed facts and information that must be sorted and processed in
order to be meaningful. Data is the most important component in a database. Database
dictionaries are used within an organization to consolidate, document, control, and
coordinate the use of data. 

 People: People who monitor and govern databases and perform various types of database
operations in the DBMS e.g. Database Administrators, Software Developer/ Designers and
End Users

 Data Access Language: is a programming language that is used to create instructions that
access, edit, and remove data contained in a database. e.g. SQL
 Types of Database
Management Systems

Definition of terms:

 Data: Can be defined as facts that can be recorded. It can be in different formats such as
text, numbers, videos, images etc

 Database: Is collection of related data that represent some real world entities.

 Information: Meaningful or processed data

 DBMS: A DBMS is a (usually complex) piece of software that sits in front of a collection
of data, and mediates applications' accesses to the data, guaranteeing many properties about
the data and the accesses. It is used for managing data and simultaneously it supports
different types of users to create, manage, retrieve, update and store information
(tutorialspoint n.d).
 Types of Database
Management Systems…cont
 DBMSs can be divided into two broad categories i.e. relational and non-relational. Each category with subcategory.
(Akhtar, 2023).
 Types of Database
Management Systems…cont
1) Relational DBMS:

 Relational DBMSs are the most popular form of DBMS. The relational model is based on a table with columns and rows:

● Each column represents a data attribute.

● Each row represents a distinct database record.
● Each field in the table represents a data value.

 For example, a student table stores the records of various students, a row of this table represents the record of a single student and
the column represents the attributes of the record such as student id,first_ name, last_name, age, address etc.

DB Table: STUDENTS
 Types of Database
Management Systems…cont
 The basic and advanced operations are performed using some kind of database language, with Structured Query Language (SQL) being a
well-established standard .We use SQL to manage, organize and perform various operations on RDBMS.

 Example of the SQL query to create table above:

 RDBMS have been most common types of DBMS type. The market-leading traditional RDBMSs are Oracle, MySQL,
Microsoft SQL Server and PostgreSQL.
 Types of Database
Management Systems…cont
2) Non-relational DBMS:

 Non-relational DBMS are further divided into three subcategories:

a) NoSQL: NoSQL database systems do not use a relational data model like RDBMS and generally have no SQL interface
b) Spatial DBMS: Spatial DBMS is different type of DBMS that can efficiently store, query, and manipulate spatial data
c) Temporal DBMS: Temporal DBMS deals with the data related to timestamps or events.
 
 A non-relational database is a database that does not use the tabular schema of rows and columns found in most traditional database
systems. Instead, non-relational databases use a storage model that is optimized for the specific requirements of the type of data
being stored. For example, data may be stored as simple key/value pairs, as JSON documents, or as a graph consisting of edges and
vertices.

 An example using a graph data store:

A graph data store manages two types of information, nodes and edges. Nodes represent entities, and edges specify the relationships
between these entities.
 Types of Database
Management Systems…cont
 This structure makes it straightforward to perform
queries such as "Find all employees who report
directly or indirectly to Sarah" or "Who works in the
same department as John?"
 For large graphs with lots of entities and
relationships, you can perform complex analyses
quickly.
 Common mistakes in design of
Databases
The right database design will give less trouble during deployment, development, and performance. Hence, to get it right in one go, here is a list of
some mistakes to avert while designing a database (Varshneya,2022).

 Poor Design/Planning
Consequences of poor planning can be seen further down the line and impacts projects in terms of time management.

 Ignoring Normalization
Normalisation is a process that transforms a rough idea of tables and columns into a database design that follows a specific set of rules, which aims
to be efficient and eliminate redundancy.

 Redundant Records
Redundancy in a database is a condition in which the same set of data is stored at two different places. This means two different spots or two
separate fields in software. This is a problem for developers because they must keep several versions of data updated.

 Poor Naming Standards

Naming is a personal choice; however, it is an important aspect of documentation. Poor naming standards result in messy and large data files. To
avoid bad naming, pick one standard and stick to it; ensure that names make sense to other developers (Varshneya,2022).
 Common mistakes in design of
Databases…cont
 Lack of Documentation
As per a survey conducted, the second most challenging task faced by developers was poor technical documentation. Lack of documentation leads to the
loss of vital information or a tedious handover process to a new programmer.

 Ignoring Frequency or Purpose of the Data

By ignoring the fundamental purpose of data, a designer shifts away from the primary goal of storing and retrieving data efficiently when needed. Lack of
purpose of data results in no knowledge of what the data represents, at what rate and how it is going to be acquired, what will be the operational volume,
and how to use it.

 Insufficient Indexing

Indexes on a database are objects that allow certain queries to run more efficiently. Insufficient indexing comes from a SQL configuration whose
performance is affected due to improper, excessive, or missing indexes. In case indexes aren’t created properly, the SQL server goes through more records
to retrieve the data that’s requested by the query.

 Lack of Testing
The lack of database testing fails to give information on whether the data values stored and received in the database are valid or not. Testing helps to save
transaction data, avoids data loss, and prevents unauthorized access to information.
 References

• Gehrke, Johannes. (2016). DBMS Component. 10.1007/978-1-4899-7993-3_672-2.

• https://www.javatpoint.com/types-of-databases
• Fichte, J.K., Hecher, M., Thier, P. and Woltran, S., 2022. Exploiting database management systems and treewidth for counting. Theory and Practice of Logic
Programming, 22(1), pp.128-157.
• Narang, R., 2011. Database Management Systems, pp.39.48
• Codd, E.F., Data Models in Database Management, pp.112
• (Danette McGilvray 2021)
• Data Models in DBMS | GATE Notes (byjus.com)
• Types of Database Management Systems: https://onlinebusiness.umd.edu/blog/types-of-database-management-systems/
• Alzahrani, H. (2016). Evolution of object-oriented database systems. Global Journal of Computer Science and Technology.
• What are the different types of DBMS: https://www.tutorialspoint.com/what-are-the-different-types-of-dbms