Professional Documents
Culture Documents
Arranged by :
Krisnawati Br Hombing (2016031128)
Monica Desi Deria Br Ginting (2016031090)
Lecturer :
Swesti Mahardini, S.Kom, MMSI
2019
TABLE OF CONTENTS
Definition ........................................................................................................................... 2
REFERENCES ............................................................................................................................. 17
2
RELATIONAL DATABASE MODEL
1. Definition
The database is the storage of a collection of information systematically in a
computer so that it can be checked using a computer program to obtain
information from the database. The software used to manage and call database
queries is called a database management system(DBMS).
3
3. Database Model
• Hierarchical
Having a tree structure where fields only have one parent (parent), each parent has
many children (children). This model has a good speed.
• Network
Relationship is made using a linked list (pointer). Unlike the hierarchical model one child
can have several parents. This model has high flexibility.
• Relational
4
• Object oriented
Object Oriented Database is a database system that combines all object oriented
concepts such as inheritance, abstraction, encapsulation, etc. This model can interact
well with object-oriented programming languages such as java and C ++.
5
4. Relational Database
In recent years, database management systems (DBMS) have become the choice in
terms of data storage for information systems ranging from processing large commercial
transaction applications to desktop PC-based applications. Most of those used at this
time are relational database models using the Relational Database Management
System(RDBMS).
RDBMS provides easy data organizing services but has the ability to handle huge
amounts of data. Some examples of RDBMS include:
Firebird, created by the open source community based on the Interbase code.
The relational database has a "logical" structure called Relations. Relationship structure
is a 2-dimensional data structure and at the "physical" level in the form of a table (table).
An attribute represents an element of data related to a relation. For example, Student
relations have attributes such as nim, name, place of birth. birth date, and address.
Data values of attributes of a relation will be stored in tuples or rows from the table. The
picture below is an illustration of a relation.
6
DESIGN OF A RELATIONAL DATABASE
Is a process to represent the desired real world facts into a computer system, so that
the user is easily understood by considering the ease of implementation and
processing.
7
The term 'real world' (real world) is meaningful to all unstructured data that is real /
related in the scope of the system being reviewed. The real world here can be said to
be a domain as a whole / full or subdomain, for example if we consider a company as a
domain then we can assume the units in the company are subdomains or it could be a
business process or activity in we can also consider the company as a subdomain and
even a domain. Every real world that exists has unequal characters. For example the
real world for the banking system is definitely not the same as the real world for the
hospital system. The question is whether the real world in one bank with another bank
must be the same?
1. There are rules, rules of business processes that will be used as models.
2. There is a structure (regularity) of data to be stored and how the data structure will be
implemented into a physical database.
3. The characteristics of the data to be stored are clear. Example: In the hospital system
for example there are: doctors, patients, drugs, rooms, and others.
Is a way of how a database is made through certain stages, starting from the problem
investigation stage to the implementation stage.
In general there are two stages of the database design process, namely:
Is a process of defining entities and relations (Relationship) from the real world that are
designed, based on information needs and processing data from the organization
concerned.
8
- Entity / entity is a set of objects that can be identified and distinguished in the user
environment
The goal of designing database logic is the flexibility of the data model generated and
the efficiency of its implementation in the computer.
It is a process to implement the results of logic design into a computer physically that
depends on the DBMS software selected. The process carried out:
• Determine the structure for each table, including field names, types, widths and key
fields.
• Determine the name of the database and the name of each table, as well as the
location of the storage (drive, directory / folder).
• Calculate the approximate space needed for all tables and for the entire index.
1. Conventional approach
Database design without going through the conceptual design stage. In general, the
design steps are as follows:
• Modeling relationships
• Normalization
• Implementation using certain DBMS (Access, SQL, etc.). Table structure, key
attributes, integrity rules, relationships between tables.
9
Implementasi
Pembuatan melalui DBMS
Normalisasi
REAL Model Skema Basis
WORLD Data Basis Data
Model
Relasi Data
relasi
2. Entity-Relationship Approach
Using the conceptual model approach. In general, it has the following stages:
• Nomination
• Implementation using certain DBMS (Access, SQL, etc.). Table structure, key
attributes, integrity rules, relationship between tables.
10
Imple-
mentasi
Normalisasi melalui
Pembuatan
Model Model Skema DBMS
REAL Data Data Basis Basis
WORLD E-R Relasi Data Data
Model
Kon-
septual
Figure 2 ER approach
3. Database Language
This Data Definition Language functions to specify database schema. With this
language the user is possible to create new tables, indexes, change the structure of
tables, determine the storage structure of tables, and much more. The result of DDL
compilation is a collection of tables stored in a special file called a data dictionary (data
dictionary) or data directory. The data dictionary is a file in the form of metadata, that is
data about data. This data dictionary will always be accessed in a database operation
before the actual data file is accessed.
The level of abstraction discussed earlier does not only apply to the definition or
structure of data but also to data manipulation. Data manipulation itself can be:
11
At the physical level, we must define an algorithm that allows efficient access to data. At
a higher level, it is important not only access efficiency but also the efficiency of user
interaction with the system.
• Procedural, requires the user to determine what data is needed and how to get the
data.
• Non-procedural, requires the user to determine what data is needed without making
any mention of how to obtain the data.
3. Transaction control
4. Embedded and Dynamic SQL, for example C, C ++, Java, Cobol, Pascal, etc.
Not all DBMS have this facility, one example of a DBMS that has this facility is Oracle
where Oracle can load classes written using the Java programming language into the
database.
12
DATABASE IN A DISTRIBUTED ENVIRONMENT
For example :
*A bank has many branches, even in a city can consist of several branches / offices.
*Each location has a network own local, and all local networks it is connected to one
another forming a national network.
Network Topology
a. Star topology
b. Ring Topology
c. Bus Topology
13
Transaction Type
1. Local Transactions
Transaction that access data at a node (machine / server) which is the same as the
node from which the transaction it is executed.
2. Global Transactions.
Transactions that require accessing data at node which is different from the node where
the transaction is run, or a transaction from a node requires accessing data to a number
of other nodes.
a set of files that are in various places but on a database in various places.
*Each place independently processes requests user who needs access to data in place
and also able to process data stored elsewhere.
14
*Increase reliability
*Management complexity
*Development costs
*Security
*Difficulty in standardization
There are several approaches relating to storage data / table in a base system
distributed data, i.e.
1.Replication
2. Fragmentation
The data in the table is sorted and spread into a number of fragments.
15
- Fragmentation can take the form of fragmentation horizontal (sorting of data records)
or
-The system then manages a number of copies from each of these fragments at a
number of nodes.
16
References:
http://teknikinformatika.fasilkom.mercubuana.ac.id/wp-content/uploads/2015/03/3.-Modul-3-
Model-Data-Relasional.pdf
https://www.academia.edu/11881427/MODEL_BASIS_DATA_RELASIONAL_JARINGAN_D
AN_HIERARKI
https://id.wikipedia.org/wiki/Model_relasional
17