Auditing Database System

7/25/2019 Auditing Database System

1/35

AUDITING DATABASE

SYSTEM

Chapter 4-Hall


2/35

DATA MANAGEMENTAPPROACHES

Flat fle


3/35

Flat fle approach

Data redundanc that contr!"ute# tothree #!$n!fcant pro"le%# !n the &at-fle en'!ron%ent( data storage,

data updating, and

currency of information

Tas data dependency the u#er)#!na"!l!t to o"ta!n add!t!onal !n*or%at!ona# h!# or her need# chan$e


4/35

Data"a#e approach

DBMS a #pec!al #o*t+are ##te%that !# pro$ra%%ed to ,no+ +h!chdata ele%ent# each u#er !#

author!ed to acce##

El!%!nat!on o* three .plu# one/ &atfle)# pro"le%


5/35

!E" E#EMENTS O$ THEDATA%ASE EN&'RONMENT

See f$ 401

DBMS

U#er# DBA

2h#!cal data"a#e

DBMS %odel


6/35

DBMS

DBMS pro'!de# a controlleden'!ron%ent to a##!#t .or pre'ent/acce## to the data"a#e and to

e3c!entl %ana$e the data re#ource

#o%e tp!cal *eature# !nclude( 2ro$ra% de'elop%ent

Bac,up and reco'er

Data"a#e u#a$e report!n$

Data"a#e acce##


7/35

DD .Data Defn!t!onan$ua$e/

a pro$ra%%!n$ lan$ua$e u#ed to defnethe data"a#e to the DBMS0

The DD !dent!fe# the na%e# and the

relat!on#h!p o* all data ele%ent#5 record#5and fle# that con#t!tute the data"a#e0

Th!# defn!t!on ha# three le'el#5 calledviews: the ph#!cal !nternal '!e+5

the conceptual '!e+ .#che%a/5 and

the u#er '!e+ .#u"#che%a/


8/35

Data"a#e '!e+#

Internal6ph#!cal


9/35

u#er

For%al acce## ( appl!cat!on !nter*ace acce## !# po##!"le " the *or%al

appl!cat!on !nter*ace#

U#er pro$ra%#5 prepared " ##te%#pro*e##!onal#5 #end data acce## re7ue#t#.call#/ to the DBMS5 +h!ch 'al!date# the

re7ue#t# and retr!e'e# the data *orproce##!n$

In*or%al acce## 7uer lan$ua$e


10/35

Data %an!pulat!on lan$ua$e .DM/

the propr!etar pro$ra%%!n$lan$ua$e that a part!cular DBMS u#e#to retr!e'e5 proce##5 and #tore data

In#ert!n$ DM co%%and# ena"le##tandard pro$ra%#5 +h!ch +ereor!$!nall +r!tten *or the &at-fle

en'!ron%ent5 to "e ea#!l con'ertedto +or, !n a data"a#e en'!ron%ent


11/35

DBMS operat!on

80 A u#er pro$ra% #end# a re7ue#t *or datato the DBMS0 The re7ue#t# are +r!tten !n a#pec!al data %an!pulat!on lan$ua$e that !#

e%"edded !n the u#er pro$ra%090 The DBMS anale# the re7ue#t "

%atch!n$ the called data ele%ent# a$a!n#tthe u#er '!e+ and the conceptual '!e+0 I*

the data re7ue#t %atche#5 !t !# author!ed5and proce##!n$ proceed# to Step 10 I* !tdoe# not %atch the '!e+#5 acce## !# den!ed


12/35

10 The DBMS deter%!ne# the data #tructurepara%eter# *ro% the !nternal '!e+ andpa##e# the% to the operat!n$ ##te%5

+h!ch per*or%# the actual data retr!e'al40 U#!n$ the appropr!ate acce## %ethod

.an operat!n$ ##te% ut!l!t pro$ra%/5the operat!n$ ##te% !nteract# +!th thed!#, #tora$e de'!ce to retr!e'e the data*ro% the ph#!cal data"a#e


13/35

:0 The operat!n$ ##te% then #tore# thedata !n a %a!n %e%or "u;er area%ana$ed " the DBMS

hen proce##!n$ !# co%plete5 Step# 45 :5and < are re'er#ed to re#tore theproce##ed data to the data"a#e


14/35

?uer lan$ua$e

A query is an ad hoc accessmethodology for extractinginformation from a database.

U#er# can acce## data '!a d!rect7uer5 +h!ch re7u!re# no *or%al u#erpro$ra%# u#!n$ the DBMS)# "u!lt-!n

7uer *ac!l!t S? the #tandard 7uer lan$ua$e

*or "oth %a!n*ra%e and

%!croco%puter DBMS#


15/35

Data"a#e Ad%!n!#trator.DBA/

!# re#pon#!"le *or %ana$!n$ thedata"a#e re#ource0

The #har!n$ o* a co%%on data"a#e" %ult!ple u#er# re7u!re#or$an!at!on5 coord!nat!on5 rule#5 and$u!del!ne# to protect the !nte$r!t o*

the data"a#e


16/35

The dut!e# o* DBA

data"a#e plann!n$@

data"a#e de#!$n@

Data"a#e !%ple%entat!on5 operat!on5and %a!ntenance@ and

data"a#e $ro+th and chan$e


17/35

Data #tructure#

the "r!c,# and %ortar o* thedata"a#e0

The data #tructure allo+# record# to"e located5 #tored5 and retr!e'ed5and ena"le# %o'e%ent *ro% onerecord to another0

Data #tructure# ha'e t+o*unda%ental co%ponent#(or$an!at!on and acce## %ethod0


18/35

Data r$an!at!on

the +a record# are ph#!callarran$ed on the #econdar #tora$ede'!ce0 Th!# %a "e e!ther sequential

or random


19/35

Data Acce## Method#

the techn!7ue u#ed to locate record# and tona'!$ate throu$h the data"a#e

The cr!ter!a that !n&uence the #elect!on o* the data#tructure !nclude

() Rapid *+e access and data retriea+

-) E.cient use of dis storage space

/) Hig0 t0roug0put for transactionprocessing

1) Protection from data +oss

2) Ease of recoery from system fai+ure

3) Accommodation of *+e gro4t0


20/35

DBMS Model

A data %odel !# an a"#tractrepre#entat!on o* the data a"outent!t!e#5 !nclud!n$ re#ource# .a##et#/5

e'ent# .tran#act!on#/5 and a$ent#.per#onnel or cu#to%er#5 etc0/ andthe!r relat!on#h!p# !n an or$an!at!on0

The purpo#e o* a data %odel !# torepre#ent ent!t attr!"ute# !n a +athat !# under#tanda"le to u#er#


21/35

Three co%%on %odel# are the h!erarch!cal5

the net+or,5 and

the relat!onal %odel#


22/35

Data"a#e Ter%!nolo$

A data attri5ute 6or *e+d7 !# a #!n$le!te% o* data5 #uch a# cu#to%er)# na%e5account "alance5 or addre##

An entity !# a data"a#e repre#entat!on o*an !nd!'!dual re#ource5 e'ent5 or a$enta"out +h!ch +e choo#e to collect data

>hen +e $roup to$ether the dataattr!"ute# that lo$!call defne an ent!t5the *or% a record type


23/35

A data5ase!# the #et o* recordtpe# that an or$an!at!on need# to#upport !t# "u#!ne## proce##e#

Associations. Record types thatconstitute a database exist inrelation to other record tpe# 8(8 8(M

M(M


24/35

H!erarch!cal %odel

The h!erarch!cal %odel !# con#tructed o*#et# that de#cr!"e the relat!on#h!p "et+eent+o l!n,ed fle#0 Each #et conta!n# aparent

and a child F!le# at the #a%e le'el +!th the #a%e

parent are called siblings. This structure isalso called a tree structure.

The h!$he#t le'el !n the tree !# the rootsegment, and the lowest le in a particularbranch !# called a leaf.


25/35

!%!tat!on o* h!erarch!cal %odel ( A parent record %a ha'e one or %ore

ch!ld record#

No ch!ld record can ha'e %ore than oneparent


26/35

Net+or, %odel

!,e h!erarch!cal5 the net+or, %odel!# a na'!$at!onal data"a#e +!thepl!c!t l!n,a$e# "et+een record# and

fle#0

The d!#t!nct!on !# that the net+or,%odel per%!t# a ch!ld record to ha'e

%ult!ple parent#0


27/35

elat!onal %odel

The relat!onal %odel portra# data !n the*or% o* t+o-d!%en#!onal ta"le#

See f$ 4081

Acro## the top o* the ta"le are attri5utes6data *e+ds7 *or%!n$ colu%n#0Inter#ect!n$ the colu%n# to *or% ro+# !nthe ta"le are tup+es)

A tup+e!# a nor%al!ed arra o* data that!# #!%!lar5 "ut not prec!#el e7u!'alent5 to arecord !n a &at-fle ##te%


28/35

*our character!#t!c#(

80 All occurrence# at the !nter#ect!on o* a ro+ anda colu%n are a #!n$le 'alue0 No %ult!ple 'alue#.repeat!n$ $roup#/ are allo+ed0

90 The attr!"ute 'alue# !n an colu%n %u#t all "eo* the #a%e cla##0

10 Each colu%n !n a $!'en ta"le %u#t "e un!7uelna%ed0 Ho+e'er5 d!;erent ta"le# %a conta!n

colu%n# +!th the #a%e na%e0

40 Each ro+ !n the ta"le %u#t "e un!7ue !n at lea#tone attr!"ute0 Th!# attr!"ute !# the pr!%ar ,e0


29/35

DATA%ASES 'N A D'STR'%8TEDEN&'RONMENT

2art!t!oned #pl!t# the central data"a#e !nto

#e$%ent# or part!t!on# that are

d!#tr!"uted to the!r pr!%ar u#er# See f$ 408

Auditing Database System

Documents

Transcript of Auditing Database System