Announcement
Starting on July 4, 2018 the Indonesian Publication Index (IPI) has been acquired by the Ministry of Research Technology and Higher Education (RISTEKDIKTI) called GARUDA Garba Rujukan Digital (http://garuda.ristekdikti.go.id)
For further information email to portalgaruda@gmail.com

Thank you
Logo IPI  
Journal > KOMPUTER DAN INFORMATIKA > KONSEP PERANCANGAN LOGIKA TERSTUKTUR BASIS DATA DENGAN AGREGASI PADA ENTITY RELATIONSHIP DIAGRAM (ERD)

 

KOMPUTER DAN INFORMATIKA
##issue.vol## 7, ##issue.no## 1 (2006): Volume 7 No.1
KONSEP PERANCANGAN LOGIKA TERSTUKTUR BASIS DATA DENGAN AGREGASI PADA ENTITY RELATIONSHIP DIAGRAM (ERD)
Article Info   ABSTRACT
Published date:
11 May 2010
 
The overall logical structure of a database can be expressed graphically by an E-R Diagram. A database which conforms to E-R Diagram can be represented by a collection of tables. For each entity set and each relationship set in database, there is a unique table which is assigned the name of the corresponding entity set or relationship set. Each table has a number of columns which, again, have unique names. A research conducted in medical check up unit of Honoris Hospital show that one limitation of the E-R model is that it cannot express relationship among relationships. The solution is to use aggregation, an abstraction in which relationship sets are treated as higher-level entity sets. Thus, a relationship set and its associated entity sets can be viewed as a higher-level entity that is treated in the same manner as any other entity. This an E-R is transformed into normalized relations by following well-defined principles of a well structure of database.
Copyrights © 2010