Document size and growth patterns in MongoDB - Time & Space Complexity
When working with MongoDB, the size of documents affects how long operations take.
We want to understand how the time to read or write a document changes as the document grows bigger.
Analyze the time complexity of the following code snippet.
// Insert a document with a growing array
const doc = { name: "example", items: [] };
// Add n items to the array
for (let i = 0; i < n; i++) {
doc.items.push(i);
}
// Insert the document into the collection
await db.collection('test').insertOne(doc);
This code builds a document with an array that grows in size, then inserts it into the database.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Adding items to the array inside the document.
- How many times: The loop runs n times, where n is the number of items added.
As the number of items n increases, the document size grows, making the insert operation take longer.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 10 array additions and a small insert |
| 100 | About 100 array additions and a larger insert |
| 1000 | About 1000 array additions and a much larger insert |
Pattern observation: The time grows roughly in direct proportion to n, because each added item increases the document size and work done.
Time Complexity: O(n)
This means the time to build and insert the document grows linearly as the document size grows.
[X] Wrong: "Adding more items to the document does not affect insert time much because it's just one insert operation."
[OK] Correct: The insert operation must write the entire document, so bigger documents take more time to process and store.
Understanding how document size affects operation time helps you design efficient data models and answer questions about scaling in real projects.
"What if instead of one large document, we split the items into multiple smaller documents? How would the time complexity change?"