Before understanding file organization (heap, sequential, hash), it helps to know how data is actually stored on disk in a DBMS. The disk storage structure describes the physical layout of data on the disk and how the DBMS accesses it.
In simple terms, the DBMS stores records inside pages (or blocks), which are transferred between disk and memory as units. The performance of queries and file organizations depends heavily on this underlying disk structure.
Basic Components of Disk Storage
A magnetic disk is made up of several concentric tracks on each disk surface. Groups of tracks at the same radius form a cylinder. Each track is divided into sectors, which are the smallest addressable units on the disk.
Conceptually, the DBMS groups multiple sectors into a block or page (for example, 4 KB or 8 KB). A page is the unit of I/O between disk and main memory:
The DBMS reads or writes one page at a time.
A heap file, sequential file, or hash file is stored as a sequence of such pages on disk.
Why Disk Pages Matter
Because disk I/O is relatively slow, the DBMS tries to minimize the number of page reads and writes.
A record is stored inside a page, possibly with many other records.
When a query needs to read a record, the DBMS reads the entire page containing that record into memory.
If the file is ordered (sequential) or uses hashing, the DBMS can locate the correct page faster.
The structure of disk storage (pages, blocks, tracks, cylinders) affects:
How fast records can be accessed (seek time, rotational delay).
How efficiently file organizations like heap, sequential, and hash can be implemented.
Connection to File Organization
A heap file stores records in any order across pages; the DBMS just packs records into pages until they are full.
A sequential file arranges records in sorted order within pages, so that sequential scans follow the physical layout.
A hash file maps records to buckets, where each bucket may consist of one or more pages.
In all cases, the DBMS deals with pages, not individual records, when reading from or writing to disk.
Summary
Disk storage structure in DBMS refers to the way data is organized physically on disk into tracks, sectors, and pages. Pages are the basic units of I/O, and file organizations (heap, sequential, hash) determine how records are arranged within these pages. Understanding disk storage structure is essential for seeing why certain file organizations are faster for inserts, scans, or point queries, and how the DBMS optimizes performance by minimizing page accesses.