|
BACK TO 100 examples in Business, Operations and
Engineering. |
|
Do it once, do it right, and do it now.
|
|
Back to Lawson Computing Homepage
|
Apply as needed,
when needed. |
|
Learning Objectives for Database Management Systems. |
|
ch 1 DataBase Environment |
ch 6 Logical Design |
ch 11 Advanced Features |
|
ch 2 DataBase Application |
ch 7 Physical Design |
ch 12 Data Administration |
|
ch 3 DataBase Development |
ch 8 SQL |
ch 13 Client Server |
|
ch 4 Entity-Relationship |
ch 9 Implementing |
ch 14 Hierarchical Systems |
|
ch 5 Object Oriented Model |
ch 10 Query by Example. |
ch 15 CODASYL Systems |
Chap 1
List six basic principles of information resource management.
Contrast centralized and distributed databases and describe two types of distributed databases.
List major characteristics of file processing systems and list several shortcomings of these systems.
List major advantages of a database processing approach compared to the traditional file processing systems.
Draw a high level enterprise data model for a simple organization.
Describe the major components of a database environment.
Contrast a process driven approach to a data driven approach to information system development.
Chapter 2
Identify the steps in the development of a database.
Variety of skills needed to develop and design a database application.
List the Rudimentary features of a database management system.
Explain the various components of a DBMS including tools to assist in nonprocedural programming.
List types of Relational database mgmt. Systems and the relational database query languages.
Read entity-relational diagrams and draw simple entity relationship diagram to describe a database.
Chapter 4.
Draw an entity-relationship (E-R) diagram to represent common business situations.
Define unary, binary and ternary relationships and an example of each.
Model multivalued attributes and repeating groups in an E-R diagram.
Model simple time dependent data using time stamps in an E-R diagram.
Model ISA relationships in an E-R diagram.
Define four basic types of business rules in a E-R diagram.
List advantages of locating business rules in repository rather than in application programs.
Chapter 5.
Draw an object oriented data model (OODM) to represent common business situations.
Describe important data types that can be managed using object oriented technology.
List 5 limitations or concerns regarding object oriented database management systems.
Give examples of several object classes and instances.
Give examples of generalization, specialization and inheritance.
Draw a message map of an object oriented data model.
Chapter 6.
Describe 4 steps in a logical database design.
List 5 properties of relations.
Define 2 properties that are essential for a candidate key.
Concise definition for first normal form=
2nd normal form=
third normal form=
Boyce-Codd normal form=
fourth normal form=
Describe four problems that might arise when merging relations.
Transform an E-R diagram to a logically equivalent set of relations.
Transform a relation in a first normal form to a set of relations in any of the following.
3rd normal=
Boyce_Codd normal=
4th normal form=
Chap 7 cis 4720 DBMS chap 7
Hierarchical and Network Models.
Hierarchical.
Example of tree structure, a set of nested one to many relationships , one to one ok to.
Parent to child, only one parent. Parent can have many children.
Record type can have only a single appearance. Can solve this but increases redundancy or Process Overhead.
Network Data Model.
Single parent rule violated , Network Data Model is used. Network Data Model permits as little or as much structure as we want. As with a Hierarchical Database Model , if a certain relationship is not EXPLICITLY included in the Database Definition, then it CANNOT be used by the DBMS in processing a database.
Two parents equal a network data model.
The simple Network Data Model supports 1:N but not M:N. Simple Model is the most common implementation of the Network Data Model.
The complex Network Data Model supports both 1:N and M:N. Only a few DBMS products support the COMPLEX DATA MODEL.
Mapping to a NETWORK Data Model:
most common implementation of the network data model is the CODASYL model. FOLLOWING STEPS:
1. Define Record types and associations.
2. define sets. (owner-member relationships).
3. eliminate Redundant keys (if unneeded)
4. define record access strategies.
Define record types = each entity in the conceptual data model becomes a CODASYL record type.
Define sets:
SET: in a network database model a ONE-TO-MANY association between two record types where first record is call an OWNER and The second a MEMBER.
Eliminate Redundant Keys.
Define record access strategies.
CALC = record access strategy for CODASYL data model in which records are stored and accessed by supplying an primary key value.
Via = a record access strategy in the CODASYL data model which records are accessed by a SET RELATIONSHIP.
DATA ACCESS STRATEGIES DEPEND ON THE WAY DATA IS ACCESS BY USERS AND THE APPLICATIONS.
Book notes.
CODASYL APPROACH TO DATABASE IMPLEMENTATION PROVIDES efficient rapid access , provided that predefined paths are used. It is somewhat less flexible and therefore more resistant to change than others, ESPECIALLY THE RELATIONAL.
MAPPING TO THE HIERARCHICAL MODEL.
Map as above.
Map the above by introducing redundancy as needed to resolve multiple parenting and ease of access to the data.
DATABASE MANAGEMENT SYSTEMS LANCE
CLIENT
DATA
DATA INDEPENDENCE
DATABASE
DISTRIBUTED DATABASE
ENTERPRISE DATA MODEL
ENTITY
HOMONYM
INFORMATION
INFORMATION RESOURCE MANAGEMENT IRM
LOCAL AREA NETWORK
SERVER
STUCTURED QUERY LANGUAGE SQL
SYNONYM
WORK GROUP COMPUTING
CHAPTER 2
BASE TABLE
BUSINESS TRANSACTION
DATABASE APPLICATION SYSTEM
ENTERPRISE MODELING
VIEW
CHAPTER 4
ATTRIBUTE
BINARY RELATIONSHIP
BUSINESS RULES
CANDIDATE KEY
CARDINALITY
CATEGORIZATION
DEGREE
DOMAIN
ENTITY INSTANCE
ENTITY RELATIONSHIP DATA MODEL E-R MODEL
ENTITY RELATIONSHIP DIAGRAM E-R DIAGRAM
ENTITY TYPE
EXCLUSIVE RELATIONSHIP
EXHAUSTIVE SUBTYPES
EXISTENCE DEPENDENCY
GENERALIZATION
GERUND
IDENTIFYING RELATIONSHIP
INHERITANCE
ISA RELATIONSHIP
MULTIVALUED ATTRIBUTE
NONEXCLUSIVE SUBTYPE
NONEXHAUSTIVE SUBTYPE
PRIMARY KEY
RELATIONSHIP
REPEATING GROUP
SUBTYPE
SUPERTYPE
TERNARY RELATIONSHIP
TIME STAMP
TRIGGERING OPERATIONS TRIGGER
UNARY RELATIONSHIP RECURSIVE RELATIONSHIP
WEAK ENTITY
CHAPTER 5
CONNECTION
ENCAPSULATION
EXCLUSIVE SUBCLASSES
EXHAUSTIVE SUBCLASSES
GENERALIZATION HIERARCHY
IDENTITY
MESSAGE CONNECTION
MESSAGE MAP
METHOD OR SERVICE
OBJECT
OBJECT CLASS
OBJECT INSTANCE
RECURSIVE STRUCTURE
Chap 6
ALIAS
ANOMALIES
Boyce-Codd normal form BCNF
COMPOSITE KEY
DETERMINANT
DOMAIN KEY NORMAL FORM DK/NF
FIFTH NORMAL FORM 5NF
FIRST NORMAL FORM 1NF
FOREIGN KEY
FOURTH NORMAL FORM 4NF
FUNCTIONAL DEPENDENCY
HIERARCHICAL DATABASE MODEL
JOIN DEPENDENCY
LOGICAL DATA MODEL
MULTIVALUED DEPENDENCY
NETWORK DATA MODEL
NORMAL FORM
NORMALIZATION
OBJECT-ORIENTED DATABASE MODEL
PARTIAL FUNCTIONAL DEPENDENCY
RECURSIVE FOREIGN KEY
RELATION
RELATIONAL DATABASE MODEL
SECOND NORMAL FORM 2NF
THIRD NORMAL FORM 3NF
TRANSITIVE DEPENDENCY
WELL STRUCTURED RELATION
Test prep
NORMALIZED RELATIONS
If single instructor , drop the Assigned ENTITY.
A relationship w/attributes (GERUND) in an E-R diagram becomes an entity upon normalization from the E-R chart.
Sometimes must add attribute to an entity to make 3 NF (from
E-R to tables.)
A-à B = a is determinant of B. A determines exact value of B.
Boyce-Codd = Relation would have to have more than one candidate key. In B-C form if and only if every determinate key is a candidate key. Solution : put other key in own table. ~advisor has many students.
POINTERS
ADDRESS SEQUENTIAL, DATA DIRECT.
Table in key order.
POINTER SEQUENTIAL, DATA DIRECT.
Blank row at top w/ pointer to Record number of 1st in key order.
ADDRESS SEQUENTIAL, DATA INDIRECT 2 FILES.
FILE A = Copy given table.
FILE B = record #, key (in order), data pointer (to record # in FILE A.)
POINTER SEQUENTIAL, DATA INDIRECT. 2 FILES.
FILE A = Copy given table.
FILE B = BLANK FIRST ROW (EXCEPT next pointer). record # and key in RANDOM order. Data pointer to record # in
file "A". Next pointer to record # of Key order of file "B".
INDIRECTS HAVE 2 FILES.
POINTERS METHODS ARE SAME , don’t go down list. GOTO one at a time.
BOTH POINTERS HAVE BLANK ROWS AT TOP.
ISAM / VSAM
ISAM WITH COMMON OVER FLOW.
*=LAST RECORD IN TRACK.
Fit in place and move down in sequence and use same method each time.
ISAM with separate overflow tracks.
Tracks are 1,2,3 and overflows are 4,5,6. If number is booted from track 2 ,the last record will move to overflow 5.
VSAM
Sequence set is the record which is at the last of the track.
If the control interval (00,01,02,03 etc..) is full , must put in sequence set at top and into control intervals . Move have down and be consistant.
FIRST CONTROL INTERVAL IS 00.
|
BACK TO 100 examples in Business, Operations and
Engineering. |
|
Do it once, do it right, and do it now.
|
|
Back to Lawson Computing Homepage
|
Apply as needed,
when needed. |
