Record storage and page layout in DBMS Theory - Time & Space Complexity

Time Complexity: Record storage and page layout

O(n)

Understanding Time Complexity

When storing records in a database, how fast we can find or add data depends on how records are arranged on pages.

We want to understand how the time to access records grows as the number of records increases.

Scenario Under Consideration

Analyze the time complexity of searching for a record in a page-based storage system.

-- Assume a page stores multiple records
-- To find a record, the system scans records in the page one by one
FOR each record IN page LOOP
  IF record matches search_key THEN
    RETURN record;
  END IF;
END LOOP;

This code scans records sequentially on a page to find a matching record.

Identify Repeating Operations

Look for repeated actions that affect time.

• Primary operation: Scanning each record in the page one by one.
• How many times: Up to the number of records in the page (n times).

How Execution Grows With Input

As the number of records in a page grows, the time to find a record grows too.

Input Size (n)	Approx. Operations
10	Up to 10 record checks
100	Up to 100 record checks
1000	Up to 1000 record checks

Pattern observation: The time grows roughly in direct proportion to the number of records scanned.

Final Time Complexity

Time Complexity: O(n)

This means the time to find a record grows linearly with the number of records on the page.

Common Mistake

[X] Wrong: "Searching a record on a page always takes the same time no matter how many records are there."

[OK] Correct: Because the system checks records one by one, more records mean more checks and more time.

Interview Connect

Understanding how record layout affects search time helps you explain database performance clearly and shows you grasp practical data storage concepts.

Self-Check

What if the records on a page were stored in a sorted order? How would that change the time complexity of searching?

Practice

1. What is the main purpose of record storage in a database system?

easy

A. To organize data into fixed-size pages on disk for efficient access

B. To create user interfaces for database applications

C. To encrypt data before storing it

D. To manage network connections between clients and servers

Solution

1. Step 1: Understand record storage concept

   Record storage arranges data records into pages on disk to optimize reading and writing.

2. Step 2: Identify the main purpose

   This organization helps the database system access data efficiently by reading whole pages instead of individual records.

3. Final Answer:

   To organize data into fixed-size pages on disk for efficient access -> Option A

4. Quick Check:

   Record storage = organizing data in pages [OK]

Hint: Record storage means grouping data into pages on disk [OK]

Common Mistakes:

• Confusing record storage with encryption
• Thinking it manages user interfaces
• Assuming it handles network connections

2. Which of the following correctly describes a page layout in database storage?

easy

A. A user interface layout for database tools

B. A method to encrypt pages before storage

C. A network protocol for database communication

D. The structure defining how records are arranged inside a page

Solution

1. Step 1: Define page layout

   Page layout specifies how records fit and are organized inside a fixed-size page on disk.

2. Step 2: Match description to options

   The structure defining how records are arranged inside a page correctly states it defines record arrangement inside a page, unlike other unrelated options.

3. Final Answer:

   The structure defining how records are arranged inside a page -> Option D

4. Quick Check:

   Page layout = record arrangement inside page [OK]

Hint: Page layout means how records fit inside a page [OK]

Common Mistakes:

• Confusing page layout with encryption
• Mixing it up with network protocols
• Thinking it relates to user interfaces

3. Consider a database page size of 4 KB and each record size is 400 bytes. How many records can fit in one page assuming no overhead?

medium

A. 8

B. 10

C. 12

D. 15

Solution

1. Step 1: Convert page size to bytes

   4 KB = 4 x 1024 = 4096 bytes.

2. Step 2: Calculate number of records per page

   Number of records = 4096 bytes / 400 bytes per record = 10.24, so only 10 full records fit.

3. Final Answer:

   10 -> Option B

4. Quick Check:

   4096 ÷ 400 = 10 records [OK]

Hint: Divide page size by record size, ignore fractions [OK]

Common Mistakes:

• Using 1000 instead of 1024 for KB
• Rounding up instead of down
• Ignoring page overhead but still rounding incorrectly

4. A database page has a fixed size of 8 KB. If each record is 1 KB but the page header takes 512 bytes, how many records can fit in one page?

medium

A. 7

B. 6

C. 8

D. 9

Solution

1. Step 1: Calculate usable space in the page

   Page size = 8 KB = 8192 bytes. Header = 512 bytes. Usable space = 8192 - 512 = 7680 bytes.

2. Step 2: Calculate number of records

   Each record = 1 KB = 1024 bytes. Number of records = 7680 / 1024 = 7.5, so only 7 full records fit.

3. Final Answer:

   7 -> Option A

4. Quick Check:

   Usable space ÷ record size = 7 records [OK]

Hint: Subtract header size before dividing by record size [OK]

Common Mistakes:

• Ignoring header size
• Rounding up instead of down
• Using 1000 bytes for KB instead of 1024

5. A database uses a page size of 16 KB and stores variable-length records. If the average record size is 1.5 KB but some records are as small as 0.5 KB and others as large as 3 KB, which page layout strategy is best to maximize storage efficiency?

hard

A. Fixed-length slots for each record, padding smaller records

B. Use multiple small pages instead of one large page

C. Variable-length slots with a directory to track record offsets

D. Store only fixed-size records and reject variable sizes

Solution

1. Step 1: Understand variable-length record challenges

   Variable-length records vary in size, so fixed slots cause wasted space due to padding.

2. Step 2: Identify suitable page layout

   Variable-length slots with a directory allow storing records compactly and tracking their positions efficiently.

3. Step 3: Evaluate other options

   Fixed-length slots waste space; rejecting variable sizes is impractical; multiple small pages add overhead.

4. Final Answer:

   Variable-length slots with a directory to track record offsets -> Option C

5. Quick Check:

   Variable-length records = variable slots + directory [OK]

Hint: Use variable slots plus directory for variable record sizes [OK]

Common Mistakes:

• Choosing fixed-length slots causing wasted space
• Ignoring variable record sizes
• Thinking multiple small pages improve efficiency