Connector configuration in Kafka - Time & Space Complexity

Time Complexity: Connector configuration

O(n)

Understanding Time Complexity

When setting up a Kafka connector, it's important to understand how the configuration process scales as you add more settings.

We want to know how the time to apply configurations grows when the number of configuration entries increases.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

Map<String, String> config = new HashMap<>();
config.put("connector.class", "FileStreamSourceConnector");
config.put("tasks.max", "1");
config.put("file", "/tmp/test.txt");
config.put("topic", "test-topic");

for (Map.Entry<String, String> entry : config.entrySet()) {
    applyConfig(entry.getKey(), entry.getValue());
}
    

This code sets up a connector configuration map and applies each configuration entry one by one.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each configuration entry to apply settings.
• How many times: Once for each configuration key-value pair.

How Execution Grows With Input

As the number of configuration entries grows, the time to apply them grows too.

Input Size (n)	Approx. Operations
10	10 applyConfig calls
100	100 applyConfig calls
1000	1000 applyConfig calls

Pattern observation: The time grows directly with the number of configuration entries.

Final Time Complexity

Time Complexity: O(n)

This means the time to apply configurations increases in a straight line as you add more settings.

Common Mistake

[X] Wrong: "Applying configurations takes the same time no matter how many settings there are."

[OK] Correct: Each configuration entry requires a separate step, so more entries mean more time.

Interview Connect

Understanding how configuration time grows helps you design connectors that scale well and avoid slow startups.

Self-Check

"What if the applyConfig function itself loops over all existing configurations each time it is called? How would the time complexity change?"