Why table design determines performance in DynamoDB - Performance Analysis

Time Complexity: Why table design determines performance

O(n)

Understanding Time Complexity

When using DynamoDB, how you design your table affects how fast your queries run.

We want to understand how the table setup changes the work DynamoDB does as data grows.

Scenario Under Consideration

Analyze the time complexity of the following DynamoDB query patterns.

// Query by primary key
const params = {
  TableName: "Orders",
  KeyConditionExpression: "CustomerId = :cid",
  ExpressionAttributeValues: {
    ":cid": "12345"
  }
};
const result = await dynamodb.query(params).promise();
    

This code fetches all orders for one customer using the primary key.

Identify Repeating Operations

Look for repeated work done as data size grows.

• Primary operation: Reading items with the matching CustomerId.
• How many times: Once per matching item for that customer.

How Execution Grows With Input

As the number of orders for a customer grows, the work grows too.

Input Size (n)	Approx. Operations
10	10 item reads
100	100 item reads
1000	1000 item reads

Pattern observation: The work grows directly with the number of matching items.

Final Time Complexity

Time Complexity: O(n)

This means the time to get results grows linearly with how many items match the query.

Common Mistake

[X] Wrong: "Querying a DynamoDB table always takes the same time no matter how much data matches."

[OK] Correct: The query time depends on how many items match your key conditions, so more matching items means more work.

Interview Connect

Understanding how table design affects query speed shows you can build efficient apps that handle growth smoothly.

Self-Check

"What if we added a secondary index to query by order date? How would that change the time complexity?"