updateOne method in MongoDB - Time & Space Complexity

Time Complexity: updateOne method

O(n)

Understanding Time Complexity

When we update a single document in MongoDB, it's important to know how the time it takes changes as the data grows.

We want to understand how the updateOne method's speed changes when the collection gets bigger.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

    db.collection.updateOne(
      { "username": "alice" },
      { $set: { "status": "active" } }
    )
    

This code updates the first document where the username is "alice" by setting its status to "active".

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Searching through documents to find one matching the filter.
• How many times: Depends on how many documents must be checked until a match is found.

How Execution Grows With Input

As the collection grows, the time to find the matching document can increase.

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

Pattern observation: Without an index, the search grows linearly with the number of documents.

Final Time Complexity

Time Complexity: O(n)

This means the time to update one document grows roughly in direct proportion to the number of documents in the collection.

Common Mistake

[X] Wrong: "updateOne always runs in constant time because it updates only one document."

[OK] Correct: The method must first find the document, which can take longer if the collection is large and no index helps.

Interview Connect

Understanding how updateOne scales helps you explain database performance clearly and shows you know how data size affects operations.

Self-Check

"What if we added an index on the username field? How would the time complexity change?"