INFS2200 Relational Database Systems
The Complete Exam Bible · S2 2026INFS2200 Overview
- UQ Semester 2 2026
- Level 2 undergraduate
- End-of-semester examination
Relational Database Systems develops the reasoning that connects a database design to the physical work needed to answer a query. The Semester 2 2026 materials begin with relations, functional dependencies, keys and SQL, then move through views and database constraints.
- Core chain Meaning, representation, cost and plan choice
- Quantitative work Show units, formulas and database consequences
- Revision priority Practise query trees and access-path decisions
What you get in the full INFS2200 Exam Bible
- 8 chapters, 46 pages — every examinable topic
- 31 original practice questions, each with a model answer in the End-of-semester examination format
- 8 worked examples, solved the way INFS2200 marks
- 9 computed figures, redrawn from the course’s own numbers
- Exam-morning plan for the End-of-semester examination (60%) — what to revise last, where marks are lost
Free on this page: assessment table, chapter map, one worked example, key terms, FAQ. The rest is in the full exam bible.
How INFS2200 is assessed
| Component | Weight | Format |
|---|---|---|
| RiPPLE activities | 10% | Weekly create, moderate and practice activities across weeks 2 to 13 |
| Assignment 1 | 15% | Database implementation assignment, due 4:00 pm on 18 September 2026 |
| Assignment 2 | 15% | Database assignment, due 4:00 pm on 30 October 2026 |
| End-of-semester examination | 60% | Examination period from 7 to 21 November 2026; detailed format is published through the current course site |
The Semester 2 2026 weekly learning plan publishes all four weights, which total 100%. It does not state an examination duration, section structure, permitted materials or hurdle rule.
What other students are asking about INFS2200
- Where can I find lecture notes or study guides for INFS2200 at UQ?
- The INFS2200 study guide in AskSia Library covers Relational Database Systems in 8 chapters, with the assessment table, a chapter-by-chapter topic map, key terms and a worked example, free to read on this page.
- Is there a final exam in INFS2200, and how much is it worth?
- Yes. In the offering this AskSia Library guide is built from, End-of-semester examination carries 60% of the INFS2200 mark; the full split is RiPPLE activities 10%, Assignment 1 15%, Assignment 2 15%, End-of-semester examination 60%.
- What does INFS2200 cover on views, security and updateability?
- In AskSia Library's INFS2200 guide, the Views, Security and Updateability chapter explains virtual tables, query modification, materialisation and reverse mapping.
- What does INFS2200 cover on database constraints and state transitions?
- In AskSia Library's INFS2200 guide, the Database Constraints and State Transitions chapter explains static rules, legal transitions, referential actions and testing.
- What does INFS2200 cover on storage blocks and access time?
- In AskSia Library's INFS2200 guide, the Storage Blocks and Access Time chapter explains storage geometry, capacity, rotation, transfer and block layout.
Current INFS2200 dates
| Date | Item | Control |
|---|---|---|
| 18 September 2026 | Assignment 1 due | Submit before 4:00 pm |
| 30 October 2026 | Assignment 2 due | Submit before 4:00 pm |
| 7 to 21 November 2026 | Examination period | Confirm the exact examination schedule in the current course site |
The Semester 2 2026 weekly learning plan lists these dates; confirm exact submission and examination settings in Blackboard.
What INFS2200 covers
Eight evidence-led chapters connect relational meaning, physical storage and query-plan choice.
Relational Foundations and Functional Dependencies
Relations, redundancy, determinants, key closure and schema grainRelational design becomes coherent when redundancy, anomalies, functional dependencies and keys are treated as one reasoning chain.
- Relation grain and tuple meaning
- Redundancy and update anomalies
- Functional dependency tests
- Attribute closure and candidate keys
- Primary keys, foreign keys and decomposition
Views, Security and Updateability
Virtual tables, query modification, materialisation and reverse mappingA view is a named query that offers a stable logical interface over base tables. This chapter compares query modification with materialisation, explaining the freshness, storage and maintenance trade-offs.
- Views as named queries
- Logical independence and access control
- Query modification
- Materialised results and refresh
- Reverse mapping for updates
Database Constraints and State Transitions
Static rules, legal transitions, referential actions and testingConstraints translate domain promises into central database enforcement. This chapter separates static rules that describe valid states from dynamic rules that govern legal transitions.
- Static and dynamic constraints
- NOT NULL, UNIQUE and CHECK
- Primary and foreign keys
- Referential actions
- Transition rules and test pairs
Storage Blocks and Access Time
Storage geometry, capacity, rotation, transfer and block layoutLogical queries meet physical storage through database blocks. This chapter follows sectors, tracks, surfaces and blocks, then computes capacity, rotation, transfer and average access time with explicit units.
- Storage hierarchy and blocks
- Track, surface and disk capacity
- Seek and rotational delay
- Block transfer time
- Blocking factor and locality
Index Structures and Access Paths
Sparse and dense indexes, trees, hashing, selectivity and maintenanceIndexes trade storage and write maintenance for faster access to selected rows. This chapter classifies primary, clustering and secondary indexes using physical file order, key status and entry density.
- Sparse primary indexes
- Clustering and secondary indexes
- Dense entry coverage
- B+-trees and hash access
- Selectivity, clustering and maintenance
Relational Algebra Operations
Selection, projection, sets, joins, expression trees and equivalenceRelational algebra expresses a query as a pathway of relation-producing operators. This chapter separates selection from projection, checks union compatibility, composes joins and reads expression trees from the leaves upward.
- Selection and projection
- Set operators and compatibility
- Cartesian product and join
- Expression trees
- Equivalent rewrites and attribute lineage
Query Processing and Join Costs
Parsing, planning, execution, join algorithms and cost modelsQuery processing carries declarative SQL through parsing, planning and execution.
- SQL parsing and semantic checks
- Internal relational form
- Query execution plans
- Physical join algorithms
- Sort-merge cost and estimation
Query Optimisation and Selectivity
Statistics, cardinality, query-tree rewrites and safe pushdownOptimisation rewrites equivalent expressions and chooses physical access with catalogue evidence.
- Cost-based and heuristic optimisation
- Catalogue statistics
- Selectivity and cardinality
- Query-tree rewrite rules
- Estimate error and plan repair
The physical layer covers storage blocks, disk access time and database indexes. Relational algebra then supplies the operator language used to represent queries, before query processing and optimisation compare execution pathways. This guide follows those captured teaching blocks and keeps every method tied to a database decision.
You will test candidate keys by closure and minimality, distinguish a virtual view from a materialised result, classify static and dynamic constraints, and compute storage capacity and access-time quantities with units. You will compare sparse primary indexes with dense secondary indexes, translate requests into selection, projection and join trees, and use selectivity to explain why one plan should reduce intermediate work.
The published assessment allocation is 10% RiPPLE activities, 15% Assignment 1, 15% Assignment 2 and 60% examination. The captured files do not publish the final exam duration, section structure, permitted materials or hurdle rule, so those details are deliberately left to the current official course site. Every practice scenario in this book is original.
It teaches the documented concepts without reproducing graded assignment tasks. The recurring answer shape is practical: state the rule or formula, show the transformation or calculation, report the result with its unit, and explain the integrity or performance consequence.
Worked example · free
Choose the more selective predicate
- +1Region selectivity is 3,000 divided by 120,000, which equals 0.025.
- +1Premium selectivity is 240 divided by 120,000, which equals 0.002.
- +1Premium is more selective because the smaller fraction leaves fewer rows.
- +1An access-path decision still checks index availability, clustering and correlation.
Key terms
- Functional dependency
- A rule stating that one attribute set determines another in every valid state of a relation.
- Candidate key
- A minimal attribute set that determines every attribute in a relation.
- View
- A named query presented as a virtual table over base relations.
- Materialised view
- A stored query result that improves repeated reads but requires a refresh policy.
- Static constraint
- A rule that must hold in each valid database state.
- Dynamic constraint
- A rule controlling which transitions between database states are legal.
- Database block
- The physical unit transferred between secondary storage and memory.
- Sparse index
- An index with entries for only part of an ordered data file, often one boundary per block.
- Secondary index
- An alternative access path on a field that does not control physical file order.
- Relational algebra
- A closed set of relation operators used to express a data-access pathway.
- Query execution plan
- A physical operator sequence selected to produce the required relational result.
- Selectivity
- The fraction of relation tuples that satisfy a condition, where a smaller fraction filters more strongly.
INFS2200 FAQ
How is this course assessed?
The captured Semester 2 2026 plan assigns 10% to RiPPLE activities, 15% to Assignment 1, 15% to Assignment 2 and 60% to the end-of-semester examination. These values total 100%. Check Blackboard for the current operational instructions, especially the detailed examination format and submission settings.
How hard is the relational database content?
The documented challenge is cumulative reasoning. Functional dependencies influence keys and constraints, storage affects index cost, relational algebra shapes execution plans, and selectivity changes optimisation choices. Students need both symbolic accuracy and explanation. Practising one complete chain from rule to calculation to database consequence is more effective than memorising isolated definitions.
What should I know about the final examination?
The captured plan publishes a 60% examination component during the 7 to 21 November 2026 examination period. It does not publish duration, sections, question count, permitted materials or a hurdle rule. Confirm those details in the current official course site and use this guide only for documented content methods.
How do I test a functional dependency?
Treat it as a domain promise, not a pattern in current rows. Ask whether two legitimate tuples could share the proposed determinant while differing on the dependent attributes. If they could, the dependency is false. For a key, compute attribute closure and then test whether every included attribute is necessary.
When is an index useful?
An index is useful when its access path avoids enough data pages to justify storage and update maintenance. Check physical file order, equality versus range predicates, expected selectivity, clustering and write frequency. A highly unselective predicate can make a sequential scan cheaper even when a suitable index exists.
What is the safest query optimisation rule?
Preserve the relational result before reducing work. Push local selections toward base relations, replace products plus equality filters with joins, order restrictive joins early and push projections only when all later predicate, join and output attributes remain available. Then justify the change using cardinality or block-cost evidence.
Questions students ask in each INFS2200 chapter
- How do I know whether a dependency is valid?
- Try to construct two legitimate tuples with the same determinant and different dependent values. If the domain permits that pair, the dependency is false even when the current sample contains no counterexample. Explain the business rule that would force agreement before using the dependency. Chapter 01 · Relational Foundations and Functional Dependencies
- Why use a view instead of copying data?
- A view supplies a reusable logical perspective without creating another uncontrolled copy. Ordinary views stay tied to current base data, while copied tables can drift unless a separate maintenance process keeps them aligned. The definition also communicates the intended interface. Chapter 02 · Views, Security and Updateability
- What is the difference between static and dynamic constraints?
- Static constraints describe valid states, such as allowed values or required references. Dynamic constraints describe valid changes, such as forbidding a closed record from returning to an open state. A value can be statically valid but reached through an illegal transition. Chapter 03 · Database Constraints and State Transitions
- Why do database costs count blocks?
- Storage devices and buffer managers transfer pages rather than isolated logical tuples. Several rows can share one block, while scattered rows can require many block reads even when the result set is small. Page count therefore connects logical predicates to physical work. Chapter 04 · Storage Blocks and Access Time
- What makes an index sparse?
- A sparse index omits entries for some records because the ordered file lets one boundary entry guide the search to a candidate block. Without that order, omitted entries would have no predictable location. File organisation is therefore part of the definition. Chapter 05 · Index Structures and Access Paths
- Why is algebraic selection not SQL SELECT?
- Algebraic selection filters tuples and corresponds to an SQL WHERE condition. Algebraic projection keeps attributes and corresponds more closely to the SQL SELECT list. The shared word can otherwise reverse the operations, so identify rows versus columns explicitly. Chapter 06 · Relational Algebra Operations
- What happens before query optimisation?
- The DBMS parses the statement, resolves names, checks types and permissions, and forms an internal relational representation. Plan comparison requires a valid query meaning first. A physical access path cannot repair an unresolved or unauthorised reference. Chapter 07 · Query Processing and Join Costs
- Does a higher selectivity value filter more rows?
- No. Under the course definition, selectivity is the surviving fraction. A smaller value leaves fewer rows and therefore represents a more selective condition. Write the survivor count beside the fraction to keep the direction clear. Chapter 08 · Query Optimisation and Selectivity
How to study for the exam
Begin each revision session with one connected pathway rather than a chapter list. On one day, move from a functional dependency to a candidate key, a decomposition and a referential constraint. On another, start with a file organisation, choose a sparse or dense index and estimate the pages the access path avoids.
For quantitative work, write the relationship before substituting values, keep bytes, blocks, tuples and milliseconds visible, and finish with the database consequence. For relational algebra, annotate the attributes surviving each operator so projection pushdown never removes a later join key. For optimisation, compute selectivity and surviving rows before recommending an index or join order.
Use the answered practice cards as retrieval prompts: hide the model response, produce a compact solution, then compare your rule, working, direction word and assumption. The captured folder does not include a past final or a detailed exam-format sheet, so do not attempt to memorise an invented paper structure.
Confirm current operational details through Blackboard while using the documented teaching sequence to organise content revision.