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

01a Database Lecture Databases

Uploaded by

ayoubjamil825
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views

01a Database Lecture Databases

Uploaded by

ayoubjamil825
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Databases

Author: Dipl.-Inf. (FH) Salvatore Sabba


Lecture: 1
Content: Chapter 1
Course of
studies: Information Technology
Semester: WS 2024 / 2025
Chapter 1: Introduction
• Introduction:

 A database consists of a collection of data,


which is stored in a computer!

 Good beginning, because

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
the data is the core of a
database system,
but we need more

2
Chapter 1.1: Private example
• Private adress book
 Aim is to store information from different
individual types, e.g. friends, colleagues,
business partners, etc.

 Store Characteristics like names,


adresses, phonenumbers, etc.

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
 Collected information are stored in
an adress book for years

 Adress book becomes single point of truth


and is important – we want to keep it
permanently

3
Chapter 1.1: Private example
First request to a database:

Data has to be stored persistent

(1) Latin:
persistere – remain, stand still

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
(2) Information technology:
A storage is persistent, when it is
independent of runtime of programs or
switch on- and off of the computer

4
Chapter 1.1: Private example

Frankfurt University – Databases


5

© Dipl.-Inf. (FH) Salvatore Sabba


Chapter 1.1: Private example
• Several possibilities how to store the
existing information

 Alphabetic
 by name
 by surname

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
 by city (private or business)
 etc.

• The aim is to find entries fast and


simple

6
Chapter 1.1: Private example
Second request to a database:

There must be many different search terms


on the data pool.

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
 Show me the entry of ‘Hans
Müller’
 Show me all contacts of
‘Neapel’
 Show me all contacts with an
„@arcor.de“ email address

7
Chapter 1.1: Private example
• Result oriented communication between
user and database!
(1) Read the first entry of the databasee
(2) Check if wanted set is available
If not, read the next one

Frankfurt University – Databases


(3)

© Dipl.-Inf. (FH) Salvatore Sabba


(1) Show me the address of Simon Cowell
(2) When is the birthday of Tahir Gül
(3) How much entries of Frankfurt are
deposited in the database
8
Chapter 1.1: Private example
Third request to a database:

We need selection or search functions for our


database, with which we get the requested
view by describing the requested results.

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
Furthermore, we need so called
administration functions for our data.

9
Chapter 1.1: Private example
• Administration functions

Yesterday Today
Buy address book and Create a dataset in our
make entries database (INSERT)
Read entries Read datasets (SELECT)

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
Change entries Update datasets
(UPDATE)
Delete entries Delete datasets
(DELETE)

• Includes the four basic operations CRUD

10
Chapter 1.1: Private example
Use Case example “update ZIP code”:
• ZIP code switch in 1993 (from 4 to 5 digits)
 … old: 6057
 … new: 63128
private address book

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba


→ complicated to update all data
→ great manual effort
• electronic address book
→ possible with only one command
→ updates are only possible if certain
rules are followed
11
Chapter 1.1: Private example
Redundancy:
• Available address database
Surame Name City

Redundancies
Müller Moritz Frankfurt
Schubert Matthias Frankfurt a.M.

Frankfurt University – Databases


Goethe Johann Wolfgang Frankfurt/Main

© Dipl.-Inf. (FH) Salvatore Sabba


Valenti Gaetano Frankf.
Bohlen Dieter FFM
• All described search and administration
functions have no possibility to be
implemented in such case!

12
Chapter 1.1: Private example
• Definition redundancy:

Redundancy means that individual data


exists several times

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
• Consequences of such redundancies
 Datasets are
… difficult to find and
… difficult to change

13
Chapter 1.1: Private example
Use Case example “data
inconsistence”:
Surname Name Mobile
Madmar Mohamed 015/085
Mohamed Madmar 015/085

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
• Update mobile # from 015/085 in 015/007

inconsistence
Surname Name Mobile

Data
Madmar Mohamed 0151 / 007
Mohamed Madmar 0151 / 0815

14
Chapter 1.1: Private example
• Definition Data inconsistency :

In the information technology,


inconsistency of data stands for
contradictions between the data
(source: Wikipedia)

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
• Problem can be prevented by avoiding
redundancies

15
Chapter 1.1: Private example
• Request to a database:
The database should be designed in that way,
so you can store the data without
redundancies.

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
 Avoid redundancies by
 Inserting information with
existing ref. tables
 checking the values
 Simplifying of the entry due to
separation of the fields
16
Chapter 1.2: Public example
• SETON Online Shop

 Database with
 Customer,
 Article and
 Campaign information

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
 Customer can…
 search for article,
 order articles and/or
 insert the campaign code
…on the Homepage
17
article
customer
Chapter 1.2: Public example

campaign

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
18
Chapter 1.2: Public example
• Request to a database:

A database has to be designed for


multi-user operation system.

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
19
Chapter 1.3: Summary
• What do we expect from a database
system?

 Persistent storage of data


 Different search possibilities
 Insert-, Update- and Delete operation

Frankfurt University – Databases


© Dipl.-Inf. (FH) Salvatore Sabba
 Avoid redundancies and Data
inconsistency
 Multi-User operation system

20
End Chapter 1

You might also like