File Access Methods

<h3>Definitions &amp; Key Points</h3><h4>1. Sequential Access</h4><h2><!--StartFragment--><p>Information in the file is processed in order, one record after another. To reach record $N$, the system must traverse records $1$ through $N-1$. It mimics the behaviour of physical magnetic tapes.</p><ul><li><p><b>Key Points:</b></p><ul><li><p>Uses internal read/write pointers that automatically advance with every operation.</p></li><li><p>Typical use cases include compilers reading source code, log processing, and media playback.</p></li></ul></li><li><p><b>Advantages:</b></p><ul><li><p>Very simple to implement and manage.</p></li><li><p>Highly efficient for batch processing and streaming where every record must be visited.</p></li></ul></li><li><p><b>Disadvantages:</b></p><ul><li><p>Extremely slow for arbitrary lookups; reaching record 1,000 requires reading the prior 999 records.</p></li><li><p>Inefficient for real-time or interactive applications.</p></li></ul></li></ul></h2><h4>2. Direct (Random) Access</h4><h2><p>The file is viewed as a numbered sequence of fixed-length blocks or records. The operating system can read or write any block immediately using its block number, bypassing all preceding data.</p><ul><li><p><b>Key Points:</b></p><ul><li><p>Relies on disk devices (like HDDs and SSDs) that support random block positioning.</p></li><li><p>Common operations include <code data-path-to-node="8,0,1,1,0" data-index-in-node="26">read(n)</code> and <code data-path-to-node="8,0,1,1,0" data-index-in-node="38">write(n)</code>, where $n$ is the block number.</p></li><li><p>Essential for database management systems (DBMS), virtual memory swap files, and key-value stores.</p></li></ul></li><li><p><b>Advantages:</b></p><ul><li><p>Fast, direct retrieval of specific records with predictable access time.</p></li><li><p>Enables in-place updates of records without rewriting the whole file.</p></li></ul></li><li><p><b>Disadvantages:</b></p><ul><li><p>More complex operating system metadata and boundary tracking.</p></li><li><p>Inefficient when records are variable in size.</p></li></ul></li></ul></h2><h4>3. Indexed Access</h4><h2><p>An auxiliary index structure is built on top of the base file. The index contains keys paired with pointers to their physical locations, functioning like an index at the back of a textbook.</p><ul><li><p><b>Key Points:</b></p><ul><li><p>Can be single-level or multi-level (e.g., B-Trees, B+ Trees).</p></li><li><p>The system searches the index first, finds the target address, and jumps straight to the block.</p></li><li><p>Common in relational databases and large-scale search engines.</p></li></ul></li><li><p><b>Advantages:</b></p><ul><li><p>Combines rapid searching of massive datasets with variable-length record support.</p></li><li><p>Allows queries on non-sequential attributes without scanning the entire file.</p></li></ul></li><li><p><b>Disadvantages:</b></p><ul><li><p>Requires extra storage space to store and maintain index tables.</p></li><li><p>Updates, insertions, and deletions incur overhead to keep the index synchronized.</p></li></ul></li></ul></h2><h3>Comparison of Access Methods</h3><h2><table><thead><tr><td><strong>Feature</strong></td><td><strong>Sequential Access</strong></td><td><strong>Direct (Random) Access</strong></td><td><strong>Indexed Access</strong></td></tr></thead><tbody><tr><td><b>Search Speed</b></td><td>$O(n)$ (Slow for lookups)</td><td>$O(1)$ (Fast via block ID)</td><td>$O(\log n)$ (Fast via key)</td></tr><tr><td><b>Storage Overhead</b></td><td>None</td><td>Minimal</td><td>High (Index tables)</td></tr><tr><td><b>Best Used For</b></td><td>Compilers, logs, audio files</td><td>Databases, swap files</td><td>Large databases, search records</td></tr><tr><td><b>Complexity</b></td><td>Very Low</td><td>Moderate</td><td>High</td></tr></tbody></table></h2><h3>Significance of File Access Methods</h3><h2><ul><li><p><b>Optimizes I/O Bottlenecks:</b> Secondary storage is drastically slower than RAM; selecting the right access method minimizes physical disk arm movements and unnecessary block reads.</p></li><li><p><b>Application Fit:</b> Enables developers and systems to tailor file layouts to usage—such as streaming video vs. processing a banking transaction.</p></li><li><p><b>Resource Management:</b> Balances disk space overhead against CPU lookup time and memory utilization.</p></li></ul></h2>