52 lines
1.8 KiB
Plaintext
52 lines
1.8 KiB
Plaintext
- 4 questions, do 3
|
|
- same type of questions as previous years
|
|
- overlap in terms of style with exercise sheets
|
|
- most questions have 3 parts with different marks
|
|
|
|
- question 1 is on design (first topic covered)
|
|
a) functional dependencies minimal cover sets (problem based)
|
|
b) normalisation to BCNF (decursive/descriptive)
|
|
c) denormalisation (decursive/descriptive)
|
|
|
|
- key things to know in general:
|
|
- functional dependency
|
|
- axioms to generate new functional dependencies
|
|
- minimal cover sets
|
|
- normal forms
|
|
- redundancy / denormalisation
|
|
|
|
- question 2: transactions
|
|
a) discuss one of problems (only 3 (think lost update problem etc not sure)) (supposedly easy)
|
|
b) concurrency control protocol to apply to above problem, such as timestamping, two phase locking etc.
|
|
c) distributed databases, how do we manage recovery or two phase locking or something
|
|
|
|
- problems that arise: concurrency control, lost update, etc
|
|
- serialisability, guarantee serialisability
|
|
- recovery, system log
|
|
- distributive databases
|
|
|
|
- question 3: indexing
|
|
a) b trees
|
|
b) dynamic indexes
|
|
c) multiattribute indexes / joint attribute indexes
|
|
|
|
- B tree, B+ tree (will be asked on b trees)
|
|
- hashing
|
|
- extendible / dynamic
|
|
- linear
|
|
- multi-attribute
|
|
- operators
|
|
|
|
|
|
- question 4: database models
|
|
a) parallelism
|
|
b) deductive / logic databases (not covered on past papers) (not too hard because we didn't spend long on it)
|
|
- store facts and relations
|
|
c) security (one of the models touched on 2023-11-14) (not covered on past papers)
|
|
- bell lepageol model or something of security
|
|
|
|
- old course was called ct332
|
|
- will get deductive / logic databases on old papers
|
|
|
|
- no more exam material after ./slides/DatabaseSecurity.pdf
|