DDD Pointers
DDD Pointers
1
Un-normalized database, this table is un-normalized.
Student No
S1
S3
S4
S1
S3
Student Name
Tom
Mary
Susan
Tom
Mary
Module Code
DDD
DDD
WS
WS
WS
Module Name
DB Design & Deve.
DB Design & Deve.
Website
Website
Website
Functional dependence, it is when two unique attributes in a table are linked to each
other. Some examples are:
Student Name
Tom
Mary
Susan
Module
Module Code
DDD
WS
Module Name
DB Design & Development
Website
Student Module
Student
S1
S1
S3
S3
S4
Module
DDD
WS
DDD
WS
WS
Deletion
Insertion
Update
3
Be able to write select statements
Be able to write select statements that link tables and use more than one condition
4
Be able to explain iterative development and explain how it differs from linear
development (year 1 DB slide 9.11)
Why foreign key must be linked to the candidate key. (Because of the referential
integrity rule, the foreign key must be linked to the candidate or it may be null)
8
How the joining of multiply tables affect performance.
9
Co-relative sub-queries
10
Research why database developer need to understand classes in database products
11
What approaches would the database developers need to use to keep up with the
products?
12
Atomic relations (year 1 slide 5.17-21). The atomic rule means that each cell must
have only one value.
13
What happens when a transaction fails before it is completed.
It performs a rollback. Rollback is to undo the actions that have already been done.
Or it could be said that the database was returned to a known stable state.
14
Why a column would be made derived data.
(Derived data is when you examine the columns to find the necessary data to get
the desired result for a column.)
15
Be able to consider two factors when implementing derived data.
Three factors are how often the derived data needs to be calculated and when
theres a danger of losing the information and how it affects the performance of
the database.
What is derived data? (Year 2 slide 7.4)
16
When a derived column is affected, how does it affect the implementation?
17
Discuss three ways how domain constraints can be implemented.
(Year 1 slide 11.12-15)
18
How can a database model be used to identify different types of constructs that will
be implemented in a database system?
19
How can business rules be enforced. (slide 8.18).
22
How data loading can be automated. (Through the use of data loading tools) (year 1
slide11.18)
23
What issues may arise as the database acquires more data over its lifespan. (Some
are storage, performance and it may out-serve its purpose.)
24
Five reasons why originations would implement distributed databases (slide 10.6)
25
26
Explain federated databases (slide 10.22)
27
Explain time variant and give an example (slide11.15)
28
Consider four tasks to perform during the acquisition on the data warehouse (slide
11.18)
29
State and discuss why an organization may want to implement a data warehouse.
Some reasons are (slide 11.5):
To make use of the large pool of data that would contribute to management
decision making
To gain a competitive advantage of over competitors
For strategic planning
Be able to view multi-dimensional data
It acquires new business
Where to invest
Notes:
A Super key is a unique key that identifies a table.
Example of super type is student being the super key and the sub type being Full
time student and part time student.
A recursive relationship is an entity that has a relationship with itself
A database trigger is a store procedure or block of code that is fired by a event.
In a Homogenous distributed database, the units have the same Operating System
and Database.
In a Heterogeneous distributed database, the units have different Operate System
and the databases are in grated systems on a network.