|
 

 
   
`



@ @




Join this group
þ  |

 "on-Relational Systems
Flat-File Systems
Hierarchical Systems
"etwork System

= th Feb 20=0 DB-I by M.A.K DCS UOP 3

"
     
 Database systems can be conveniently
categorized according to the á



and  
 they present to the user

 vhe oldest system fall into three broad

categories:

Flat-File Systems
Hierarchical Systems
"etwork Systems

= th Feb 20=0 DB-I by M.A.K DCS UOP 4

ï 
ï   
ï 
ï   
 vhe file system was a start. However, it was
seriously inefficient
Essentially, in order to find a record,
someone would have to read through the
entire file and hope it would not be the last
record
þ
 
á
á


 ©hat was needed, computer scientist thought,

was a ³card catalog´
= th Feb 20=0 DB-I by M.A.K DCS UOP 6
ï 
ï   
 So the result was the ³indexed file-oriented
systems´
 a single index file stored ³key´ words and
pointers to records that were stored else
where. vhis made retrieval much more easier.

 ð

áá

vo find data, one needed only search for keys
rather than reading entire records.
vhis was referred to as ³flat-file systems´

= th Feb 20=0 DB-I by M.A.K DCS UOP 7

ï 
ï    
 Even with the benefits of indexing, the file-
oriented systems still suffered from problems
discussed before

÷
  
the same data might be stored in
different places

K
÷
 


redundant data might be slightly
different such as in the case when XYZ changes his city
and the change is only reflected in some of the files
containing his data

þ  

     
÷

it was a tedious
and error prone activity to modify files by hand
= th Feb 20=0 DB-I by M.A.K DCS UOP 8
~  
@
 
 
~  
@
 
 
 Early databases were Hierarchical databases

Records are arranged in top-down structure, that

resembles a tree

vhey used a hierarchical structure, in which all related

data had a À




 

 
 A parent data item could have multiple child data items,
but a child could only have one parent

Relationship between related data were created using

pointers, which are links to the physical locations where
data was written to the disk

= th Feb 20=0 DB-I by M.A.K DCS UOP =0

~  
@
 

h


  


   
 

   
 

= th Feb 20=0 DB-I by M.A.K DCS UOP ==

K  @   @
 vhe ³parent/child´ rule assures that data are systematically
accessible .

 vo get to a low-level data, you start at the root and work your
way down through the tree until you reach your target

 One problem with this system is that
 


how the tree is structured in order to find anything!!

= th Feb 20=0 DB-I by M.A.K DCS UOP =2

~  
@
  
 One of the most popular hierarchical database
management system was IBM¶s information
management system (IMS) database system,
first introduced in =
68

©e will not have the opportunity to study IMS, but you

can see its current version (Version 8) at
http://www-3.ibm.com-software-data-ims-ims-
index.html
It is still being used and now provides additional
features

= th Feb 20=0 DB-I by M.A.K DCS UOP =3

~  
@
   
 vhe SABRE database system was jointly
developed by American Airlines and IBM at
about the same time IMS was developed

It is an airline reservation system

vhe SABRE is still used by the web-based
travel; services such as vravelocity.com

= th Feb 20=0 DB-I by M.A.K DCS UOP =4

~  
@
 
  
÷
 



 h


  
 

h


     
= th Feb 20=0 DB-I by M.A.K DCS UOP =
~  
@
 
   
 
 In summary, the following rules govern a
hierarchical data structure:
R 
á
   

   áá
 
2   !"
#$þ  á
%#!&R
&
 á
  
 ' 
 
á
 
()
 

So according to these rules can you think of

any limitations??
= th Feb 20=0 DB-I by M.A.K DCS UOP =6
~  
@
 
   
 
÷
 

h 

 h


  
 

M 



   
h
= th Feb 20=0 DB-I by M.A.K DCS
 


UOP
 

=7
~  
@
 
   
 
÷
 

h 

 h



  
 

v   

    
= th Feb 20=0 
DB-I by M.A.K DCS UOP     
=8
~  
@
 
   
 

h


  


   
 

   
 

= th Feb 20=0 DB-I by M.A.K DCS UOP =

~  
@
 
 K
 
 In the previous example, at the physical
layer, customers are linked to their
associated orders data by using pointers

 A problem with the hierarchical database

structure is that relationships are
maintained by pointers that uses physical
addresses

= th Feb 20=0 DB-I by M.A.K DCS UOP 20

~  
@
 
 K
 
 vhe data are physically dependent on the
storage medium

 ©hen the storage medium becomes full,

or when new hardware is purchased, it is
difficult to migrate a hierarchical database
to a new storage medium

 Another problem is of redundancy

= th Feb 20=0 DB-I by M.A.K DCS UOP 2=
~  
@
 
  !   
 Although Hierarchical Database and their applications
still exists, the Hierarchical model  á  
 '

*+,- á  *+.-. vhe problems are:

h þ  


 Although the Hierarchical model¶s DBMS relieves
designer and programmer of data-dependence
problems, they must still have detailed knowledge of
the physical data storage characteristics

÷

 

 Any changes in the database structure requires
changes in the application programs to access the
database

= th Feb 20=0 DB-I by M.A.K DCS UOP 22

~  
@
 
  !   
 
#

 þá á
 vhe programmer must know the access paths to the
relevant segments
h 
 
  á
 Application programs and end users must know that
how the data are distributed physically within the
database
% 

  


 Many common relationships do not conform to the
tree structure required by the model
&
á á
 

 Because there are no standards moving from one
hierarchical DBMS from another was difficult

= th Feb 20=0 DB-I by M.A.K DCS UOP 23

| 
"~  
@
 
 Although the hierarchical database model is no
longer a major player in the database market:

Its basic concepts formed the basis for subsequent

database development
Its limitation lead to better ways of thinking about
database design
Some of its basic concepts show up in current database
models
vhe hierarchical data model has been rediscovered in
some more modern databases such as object-oriented
databases

= th Feb 20=0 DB-I by M.A.K DCS UOP 24

! "#  

= th Feb 20=0 DB-I by M.A.K DCS UOP 2

R  
 An article posted on group

 Download and write a summary of it in

your own words in your own writing.

 It is about the history of databases.

 Due Date: "ext Class

= th Feb 20=0 DB-I by M.A.K DCS UOP 26

 v
 



= th Feb 20=0 DB-I by M.A.K DCS UOP 27