Disk structure and access time in DBMS Theory - Time & Space Complexity

Time Complexity: Disk structure and access time

O(n)

Understanding Time Complexity

When working with disks in databases, it is important to understand how long it takes to read or write data.

We want to know how the time to access data grows as the amount of data or disk structure changes.

Scenario Under Consideration

Analyze the time complexity of accessing a block on a disk.

-- Steps to access a disk block
seek to track position
wait for disk rotation to sector
read the block into memory
    

This shows the main steps involved in reading a block from a disk.

Identify Repeating Operations

Look at what repeats or takes time during disk access.

• Primary operation: Moving the disk head to the correct track (seek) and waiting for the disk to rotate to the right sector (rotational delay).
• How many times: Each block access requires these steps once, but if multiple blocks are read, these steps repeat for each block.

How Execution Grows With Input

As you read more blocks, the total time grows roughly with the number of blocks.

Number of Blocks (n)	Approx. Total Access Time
10	10 times seek + rotation + read time
100	100 times seek + rotation + read time
1000	1000 times seek + rotation + read time

Pattern observation: The total time increases roughly in direct proportion to the number of blocks accessed.

Final Time Complexity

Time Complexity: O(n)

This means the total time to access data grows linearly with the number of blocks you want to read.

Common Mistake

[X] Wrong: "Accessing more blocks takes the same time as accessing one block because the disk is fast."

[OK] Correct: Each block requires moving the disk head and waiting for rotation, so more blocks mean more time.

Interview Connect

Understanding disk access time helps you explain how databases manage data efficiently and why some operations take longer.

Self-Check

"What if the disk used solid-state technology with no moving parts? How would the time complexity change?"

Practice

1. Which of the following components is NOT part of the disk access time?

easy

A. Seek time

B. Rotational latency

C. Transfer time

D. Cache size

Solution

1. Step 1: Understand disk access time components

   Disk access time includes seek time (moving the head), rotational latency (waiting for the sector), and transfer time (reading/writing data).

2. Step 2: Identify the unrelated component

   Cache size is related to memory and buffering, not directly part of disk access time.

3. Final Answer:

   Cache size -> Option D

4. Quick Check:

   Disk access time excludes cache size [OK]

Hint: Remember access time parts: seek, rotate, transfer only [OK]

Common Mistakes:

• Confusing cache size with access time
• Including CPU time as access time
• Mixing memory and disk terms

2. Which of the following correctly describes the structure of a disk?

easy

A. A disk is divided into tracks and sectors

B. A disk is divided into blocks and pages

C. A disk is divided into clusters and bytes

D. A disk is divided into frames and segments

Solution

1. Step 1: Recall disk physical structure

   Disks are physically divided into circular tracks and each track is divided into sectors.

2. Step 2: Match terms with disk structure

   Blocks, pages, clusters, bytes, frames, and segments are terms used in memory or file systems, not the physical disk layout.

3. Final Answer:

   A disk is divided into tracks and sectors -> Option A

4. Quick Check:

   Disk = tracks + sectors [OK]

Hint: Tracks are circles; sectors are slices of those circles [OK]

Common Mistakes:

• Confusing file system units with disk physical units
• Mixing memory terms with disk terms

3. If a disk has a seek time of 4 ms, rotational latency of 3 ms, and transfer time of 2 ms, what is the total access time?

medium

A. 6 ms

B. 9 ms

C. 12 ms

D. 7 ms

Solution

1. Step 1: Add all components of access time

   Total access time = seek time + rotational latency + transfer time = 4 ms + 3 ms + 2 ms.

2. Step 2: Calculate the sum

   4 + 3 + 2 = 9 ms total access time.

3. Final Answer:

   9 ms -> Option B

4. Quick Check:

   4 + 3 + 2 = 9 ms [OK]

Hint: Sum seek, rotate, transfer times for total access [OK]

Common Mistakes:

• Forgetting to add all three times
• Mixing units
• Adding only two components

4. A student calculates disk access time as seek time + transfer time only, ignoring rotational latency. What is the likely effect?

medium

A. The access time will be underestimated

B. The access time will be overestimated

C. The access time will be correct

D. The access time will be zero

Solution

1. Step 1: Understand the components of access time

   Access time includes seek time, rotational latency, and transfer time. Ignoring rotational latency misses part of the delay.

2. Step 2: Effect of ignoring rotational latency

   Ignoring rotational latency means the total time is less than actual, so the access time is underestimated.

3. Final Answer:

   The access time will be underestimated -> Option A

4. Quick Check:

   Missing rotational latency lowers total time [OK]

Hint: Always include rotational latency in access time [OK]

Common Mistakes:

• Ignoring rotational latency
• Assuming transfer time covers all delays
• Confusing seek time with rotational latency

5. A disk has 5000 tracks and the average seek time is proportional to the square root of the number of tracks. If the average seek time for 2500 tracks is 4 ms, what is the average seek time for 5000 tracks?

hard

A. 4 ms

B. 8 ms

C. 5.66 ms

D. 2.83 ms

Solution

1. Step 1: Understand the proportionality

   Average seek time ∝ √(number of tracks). Given seek time for 2500 tracks is 4 ms.

2. Step 2: Calculate seek time for 5000 tracks

   Ratio of seek times = √5000 / √2500 = √2 ≈ 1.414. So, new seek time = 4 ms x 1.414 ≈ 5.66 ms.

3. Final Answer:

   5.66 ms -> Option C

4. Quick Check:

   Seek time scales with sqrt(tracks) [OK]

Hint: Use square root ratio to scale seek time [OK]

Common Mistakes:

• Using linear ratio instead of square root
• Mixing up track counts
• Forgetting to multiply by original time