Storage and retrieval methods in HSC Information Processes and Technology
“Describe the storing and retrieving information process, including online and offline storage, indexing, the role of the schema and data dictionary, backup procedures and encryption”
Storing and retrieving saves data so it persists and recalls it when needed. Storage is online (immediately available on disk or in a database) or offline (held on removable or archival media that must be loaded first). Retrieval is made fast by indexing, which keeps a sorted lookup of key values pointing to records. The schema documents the structure of the stored data and the data dictionary records each field's name, type, size and validation. Backups protect against loss with full, incremental and differential strategies, and encryption protects stored data so that, if it is stolen, it cannot be read.
Jump to a section
Legacy course. This page covers HSC Information Processes and Technology (IPT), which NESA has replaced. The last IPT HSC exam was held in 2024; current students study Enterprise Computing 11-12 or Software Engineering 11-12 (first HSC exams in 2025). See the IPT hub for what carries over, or our HSC Software Engineering hub. Use this page as background only.
What this dot point is asking
NESA wants you to describe the storing and retrieving information process as it applies to an information system: where data lives, how the system finds it quickly, how the structure of the data is documented, and how data is protected through backup and encryption. This is the process that saves data and brings it back when needed.
The answer
Online versus offline storage
Online storage is held on devices that the system can read and write immediately, such as internal hard drives, solid state drives and live database servers. It supports fast, frequent access, which transaction and decision support systems depend on.
Offline storage is held on media that must be loaded or connected before use, such as removable drives, optical discs or magnetic tape kept in an archive. It is cheaper per gigabyte and is used for backups and long-term archives where instant access is not required. The trade-off is access speed against cost and capacity.
Indexing and fast retrieval
A large table is slow to search record by record. An index is a separate, sorted structure that lists the values of a key field alongside pointers to where each record sits. Searching the small sorted index and following the pointer is far faster than scanning the whole table, in the same way a book index lets you find a topic without reading every page. Indexes speed up retrieval but add storage overhead and slow down updates, because the index must be maintained whenever records change.
Schemas and data dictionaries
The schema is the formal description of how the data is organised: the tables, fields, data types and relationships. It defines the structure that storage and retrieval operate on. A data dictionary documents each field in detail with its name, data type, field size, format and validation rules. Together they let the system, and the people maintaining it, understand exactly what is stored and how it is constrained.
Backup procedures
Backup copies data so it can be restored after loss from hardware failure, error, attack or disaster. A full backup copies everything, which is thorough but slow and large. An incremental backup copies only what changed since the last backup of any kind, which is fast but needs the full backup plus every increment to restore. A differential backup copies everything changed since the last full backup, a middle ground. Backups should be stored offsite or in the cloud so a single disaster cannot destroy both the live data and its copy.
The retrieval speed advantage of an index comes at a cost on the write side. Every insert, update or delete must also update the relevant indexes, so over-indexing a table that is written to constantly can slow the whole system rather than speed it up.
Encryption of stored data
Encryption scrambles data using a key so it is unreadable without the matching key. Encrypting stored data (encryption at rest) means that if a disk, backup tape or database file is stolen, the thief gets ciphertext, not usable information. This is a core control for protecting personal and financial data and a standard expectation under privacy obligations.
How this connects to the other processes
Storing and retrieving sits between collecting (which puts data in) and analysing, processing or displaying (which use it). A well-designed storage and retrieval layer, indexed and documented, is what lets the other processes run quickly and reliably.
Confusing online and offline with internet connectivity. Online storage means immediately accessible to the system, not necessarily connected to the internet; offline means it must be loaded first.
Describing an index as a copy of the data. An index is a sorted lookup of key values and pointers, not a duplicate of the records.
Mixing up incremental and differential backup. Incremental copies changes since the last backup of any type; differential copies changes since the last full backup. The restore procedures differ.
Saying encryption prevents data being stolen. Encryption does not stop theft of the file; it makes the stolen file unreadable without the key.
Ignoring offsite storage. A backup kept beside the original is destroyed by the same fire or flood; offsite or cloud copies are part of a sound procedure.
Exam-style questions
Questions in the style of NESA exam questions on this dot point, each with a worked answer. They are written by ExamExplained unless tagged "Past paper"; the year shows the paper a question is modelled on.
2021 HSC-style2 marksA booking table has the field sizes Student_ID (5), First_Name (25), Last_Name (25), Phone_Number (10), No_of_guests (1) and Deposit_Paid (1). If there are 200 records, show how the size of the booking table (in megabytes) can be calculated.Show worked answer →
For 2 marks show the method, not just a number. The steps are:
Add the field sizes to get the bytes in one record: 5 + 25 + 25 + 10 + 1 + 1 = 67 bytes per record.
Multiply by the number of records: 67 x 200 = 13 400 bytes for the whole table.
Convert bytes to megabytes by dividing by 1024 x 1024 (1 048 576): 13 400 / 1 048 576 is approximately 0.0128 MB.
So size in MB = (sum of field sizes x number of records) / (1024 x 1024). Markers reward showing the per-record total, multiplying by 200, and dividing by 1024 x 1024 to reach megabytes.
2022 HSC-style1 markWhich of the following specifies field names, field sizes and descriptions? A. Data dictionary. B. Structured query. C. Journals and diaries. D. Scheduling of tasks.Show worked answer →
The answer is A, Data dictionary.
A data dictionary is metadata that documents the structure of each field in a database: the field name, data type, field size and a description of what the field holds (and often validation rules). It is used when designing and maintaining the storage structure of the system.
A structured query retrieves data, journals and diaries are project management records, and scheduling of tasks is a planning technique, so none of those specify the field definitions. Only the data dictionary does.
2022 HSC-style4 marksA hotel company stores customer and booking information in a database and is developing a website to check room availability, book and pay, book activities and chat to customer service. Explain how a centralised database can be used by the company.Show worked answer →
For 4 marks explain what a centralised database is and how it supports this hotel system, with cause and effect.
Single store of data. A centralised database holds all customer, room and booking data in one location (one server or data centre) rather than spread across separate systems.
Consistent, real-time availability. Because every booking reads from and writes to the same store, room availability shown on the website is always current, preventing two customers booking the same room (no double-booking).
Easier management and security. Backups, access control and updates are applied in one place, so data integrity and security are simpler to maintain and customer records stay consistent across the website, payments and activities.
Supports integrated features. The chat, payment and activity-booking functions all draw on the same customer record, giving staff a single accurate view of each customer.
Markers reward linking the single shared store to consistency, no double-booking and easier management for this specific hotel system.