Relational databases and database schemas
Explain relational-database strengths and limits, then describe the same data at conceptual, logical and physical schema levels.
What must you be able to do
- explain features: tables, relationships, primary keys, foreign keys and composite keys;
- explain benefits: community support, concurrency control, data consistency, data integrity, data retrieval, reduced data duplication, reduced redundancy, reliable transactions, scalability and security;
- explain limitations: big-data scalability, design complexity, hierarchical/unstructured data, rigid schema and object-relational impedance mismatch;
- describe conceptual, logical and physical schemas.
Rapid Recall Deck
Attempt each card first. If a term is new, flip and study it, then answer it again without looking. Mark only secure recall as “Know it”.
Three schema levels
Describe the progression
Conceptual: Student — enrolls in — Course Logical: STUDENT / COURSE / ENROLMENT tables Physical: files/pages + indexes + storage structures
What becomes more specific as you move conceptual → logical → physical?
Conceptual identifies real-world entities/relationships without implementation detail. Logical converts them into relational tables, attributes and keys. Physical describes storage/access details such as files/pages and indexes.
Keys protect relationships
Composite + foreign keys
ENROLMENT(StudentID, CourseID) links STUDENT and COURSE. Explain why both fields are foreign keys and why the pair can be a composite primary key.
Each field references one parent table. Together the pair can uniquely identify one student-course enrolment, preserving the many-to-many relationship without duplicating student/course facts.
Integrity failure
What problem occurs if ENROLMENT contains a StudentID that does not exist in STUDENT?
The row contains an orphaned/invalid relationship. A foreign-key constraint can prevent it and protect referential/data integrity.
Why databases beat disconnected files
Apply database benefits to hospital problems
A hospital replaces separate departmental spreadsheets with one managed relational database. Explain how the database can address these four problems:
A. two staff members edit related records at the same time;
B. patient details are copied into many files and become inconsistent;
C. staff need reliable searches/transactions over shared data;
D. sensitive records must be available only to authorized users.
A relational DB can coordinate concurrent access, use constraints/keys for consistent valid data, store shared facts once to reduce duplication/redundancy, support complex retrieval and reliable transactions, centralize security and scale beyond isolated spreadsheets. Mature systems also have strong community/vendor support and tooling.
When relational design becomes awkward
Rigid/unstructured/hierarchical
A social platform stores changing nested post data. Explain two relational-model difficulties.
A rigid schema makes frequent structural changes more complex, and irregular/nested/unstructured or deeply hierarchical data may require many tables/joins or transformations instead of mapping naturally to rows and columns.
Scale + object mismatch
Explain big-data scalability issues and object-relational impedance mismatch.
Very large volume/concurrency/query load can require complex scaling/partitioning beyond a simple relational server. Object-relational mismatch occurs when application objects/relationships do not map directly to rows/tables, requiring extra mapping logic.
Benefit or limitation?
Choose from context
A small school needs consistent student records, secure access and concurrent staff use. A social platform instead stores rapidly changing irregular documents at huge scale. Explain why relational storage is a stronger default fit for one than the other.
The school benefits directly from stable schema, keys/relationships, integrity, security and concurrency. The social platform may face rigid-schema, unstructured-data and horizontal-scale challenges, so an alternative model may be worth considering.
Specimen-calibrated mini-set
Paper 1 practice
Answer: (1) explain one way a relational database provides integrity; (2) explain one way it reduces redundancy; (3) distinguish conceptual and physical schemas.
- Keys/constraints prevent invalid/orphan relationships.
- Facts are stored once in appropriate tables and referenced by keys rather than repeated.
- Conceptual = high-level entities/relationships; physical = implementation/storage/access structures.
Finish the learning cycle
IA — main task
Continue Criterion E/final-submission work. Tie evaluation statements directly to success criteria and observed evidence.
Paper 1 — short practice
Recall every relational-database feature, benefit and limitation, then explain the three schema levels.