Schema design for read-heavy workloads in MongoDB - Time & Space Complexity
When designing a database schema for read-heavy workloads, it's important to understand how the structure affects the speed of reading data.
We want to know how the time to get data grows as the amount of data grows.
Analyze the time complexity of this MongoDB query on a schema optimized for reads.
db.orders.find({ customerId: 12345 }).limit(10)
This query fetches up to 10 orders for a specific customer using an index on customerId.
Look at what repeats when this query runs.
- Primary operation: Scanning the index entries for
customerId. - How many times: Depends on how many orders the customer has, but stops after finding 10.
As the number of orders for a customer grows, the query looks through more index entries but stops early.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 10 index checks |
| 100 | Still about 10 index checks (due to limit) |
| 1000 | Still about 10 index checks |
Pattern observation: The query time stays roughly the same because it stops after 10 results, thanks to the index.
Time Complexity: O(1)
This means the query time stays about the same no matter how many orders the customer has, because it uses an index and stops early.
[X] Wrong: "More data always means slower reads in MongoDB."
[OK] Correct: With a good schema and indexes, reads can stay fast even as data grows, because the database can jump directly to needed data.
Understanding how schema design affects read speed shows you know how to build databases that handle real user needs efficiently.
What if we removed the index on customerId? How would the time complexity change?
Practice
read-heavy workloads in MongoDB?Solution
Step 1: Understand read-heavy workload needs
Read-heavy workloads benefit from fewer queries and faster data retrieval.Step 2: Choose schema design for fast reads
Embedding related data in one document reduces the need for multiple queries, speeding up reads.Final Answer:
Embed related data in the same document to reduce read operations -> Option AQuick Check:
Embedding = faster reads [OK]
- Choosing referencing for all data slows reads
- Normalizing like SQL increases read complexity
- Separating all data causes many queries
Solution
Step 1: Identify correct array embedding syntax
Embedding an array of subdocuments requires an array of objects inside the field.Step 2: Check each option's structure
{ title: 'Post', comments: [{ user: 'Alice', text: 'Nice!' }, { user: 'Bob', text: 'Great!' }] } correctly uses an array of objects for comments; others use incorrect types or formats.Final Answer:
{ title: 'Post', comments: [{ user: 'Alice', text: 'Nice!' }, { user: 'Bob', text: 'Great!' }] } -> Option AQuick Check:
Array of objects = correct embedding [OK]
- Using string instead of array for multiple comments
- Embedding a single object instead of an array
- Using array of strings instead of objects
{ _id: 1, name: 'Gadget', reviews: [{ user: 'Ann', rating: 5 }, { user: 'Ben', rating: 4 }] }What will be the result of this query?
db.products.findOne({ _id: 1 }, { name: 1, 'reviews.rating': 1 })Solution
Step 1: Understand projection with dot notation
Using 'reviews.rating': 1 includes only the rating field inside each review subdocument.Step 2: Analyze returned fields
The query returns _id, name, and reviews with only rating fields (user excluded).Final Answer:
{ _id: 1, name: 'Gadget', reviews: [{ rating: 5 }, { rating: 4 }] } -> Option BQuick Check:
Projection with dot notation = filtered subfields [OK]
- Expecting full subdocuments when projecting subfields
- Forgetting _id is included by default
- Assuming projection excludes _id without explicit exclusion
Solution
Step 1: Identify embedding drawbacks
Embedding large or frequently changing data can cause large documents and slow updates or queries.Step 2: Choose referencing for large or mutable data
Referencing addresses separately keeps user documents small and improves query speed on addresses.Final Answer:
Addresses should be referenced separately if they are large or updated often -> Option DQuick Check:
Large mutable data = use referencing [OK]
- Assuming embedding always improves speed
- Thinking MongoDB disallows embedding arrays
- Believing separate databases are needed for performance
Solution
Step 1: Analyze data change frequency
Posts change often; embedding them inside profiles would cause large documents and frequent updates.Step 2: Choose referencing for frequently changing large data
Storing posts separately and referencing them keeps profiles small and reads fast.Step 3: Avoid data duplication to prevent sync issues
Duplicating posts in profiles causes update complexity and inconsistency risks.Final Answer:
Store user profiles and posts in separate collections, referencing posts from profiles -> Option CQuick Check:
Frequent changes = referencing large data [OK]
- Embedding frequently changing posts inside profiles
- Duplicating data causing sync problems
- Embedding profiles inside posts which is illogical
Ready to prove it?
Pass the test and this pattern moves unknown
