Design a relational model, trace a retrieval plan, and compare how access strategies change time operations and space requirements as data grows.
| Rows n | Linear scan | Sorted index lookup | Index entries |
|---|
Operation counts are simplified comparison models, not wall-clock promises. Real performance depends on implementation, data distribution, caching, storage, concurrency and the database optimiser.
🎓 Learning objective: Design a relational model, trace a retrieval plan, and compare how access strategies change time operations and space requirements as data grows.
How to get the most from this studio:
Each scenario defines required behaviour — treat it as your requirements document.
Build or trace the solution, predicting state at each step as an examiner would ask you to.
Test against boundary cases, justify correctness, and evaluate fitness for purpose.
💡 Exam habit: quote the theorem, definition or calculation that supports each step.
Nothing you do here is saved or sent anywhere — experiment freely. Reopen this guide any time with the ? Help button.