Why IAM is foundational in GCP - Performance Analysis

Time Complexity: Why IAM is foundational in GCP

O(n)

Understanding Time Complexity

We want to understand how the time to check permissions grows as more users and resources are added in GCP.

How does the system handle many permission checks efficiently?

Scenario Under Consideration

Analyze the time complexity of permission checks using IAM policies.

// Pseudo-code for permission check in GCP IAM
function checkPermission(user, resource, permission) {
  policies = getIamPolicies(resource)
  for (policy in policies) {
    if (policy.appliesTo(user) && policy.includes(permission)) {
      return true
    }
  }
  return false
}

This sequence checks if a user has a specific permission on a resource by scanning its IAM policies.

Identify Repeating Operations

Identify the API calls, resource provisioning, data transfers that repeat.

• Primary operation: Scanning IAM policies attached to a resource.
• How many times: Once per permission check request.

How Execution Grows With Input

As the number of policies on a resource grows, the time to check permissions grows roughly in proportion.

Input Size (n)	Approx. Api Calls/Operations
10 policies	10 checks
100 policies	100 checks
1000 policies	1000 checks

Pattern observation: The time grows linearly as more policies are added.

Final Time Complexity

Time Complexity: O(n)

This means permission checks take longer in direct proportion to the number of policies to examine.

Common Mistake

[X] Wrong: "Permission checks happen instantly no matter how many policies exist."

[OK] Correct: Each policy must be checked to find a match, so more policies mean more work and longer checks.

Interview Connect

Understanding how permission checks scale helps you design secure and efficient cloud systems, a key skill in cloud roles.

Self-Check

"What if IAM policies were indexed by user instead of scanned? How would the time complexity change?"