Skip to main content

Explain what causes a “WriteConflict” error in MongoDB and how to handle it.

 A "WriteConflict" error in MongoDB occurs when two or more operations try to modify the same document or index entry at the same time. MongoDB uses an optimistic concurrency control model, so it doesn't lock documents in a traditional way—this means conflicts can happen if concurrent writes collide. 

Explain what causes a “WriteConflict” error in MongoDB and how to handle it.

🔍 What Causes a WriteConflict?

Here are common scenarios:

  1. Concurrent Updates to the Same Document
    Two clients try to update the same document at the same time.

  2. Secondary Index Updates
    When two operations try to update fields that affect the same secondary index entry.

  3. Long-running Writes or Reads
    A write operation that takes a while may overlap with another that tries to modify the same data.

  4. Aggressive Parallelism
    Bulk writes, aggregation pipelines with $merge, or $out, or scripts with high concurrency can lead to overlapping writes.

How to Handle WriteConflict Errors

1. Retry the Operation

MongoDB automatically retries internal operations in many cases, but if you're writing your own logic (e.g., in a script or app), you may need to implement a retry mechanism:

const maxRetries = 3; for (let attempt = 0; attempt < maxRetries; attempt++) { try { db.collection.updateOne({ _id: id }, { $set: { status: "updated" } }); break; // success } catch (error) { if (error.code === 112) { // WriteConflict error code if (attempt === maxRetries - 1) throw error; // too many retries // Wait briefly before retrying await sleep(50); // custom sleep function } else { throw error; // unrelated error } } }

2. Reduce Contention

  • Avoid multiple clients writing to the same document at once.

  • Split data so concurrent operations don’t overlap on the same fields or records.

  • Restructure your data model to reduce write "hotspots."

3. Use $merge with whenMatched: "merge" Carefully

If using aggregation pipelines with $merge, and you're merging into the same collection, avoid matching on _id only. Consider conflict resolution logic or redirecting updates to separate collections.

4. Avoid Hot Documents

When multiple operations frequently write to the same document (e.g., a counter or stats object), consider redesigning:

Summary

  • What it is: A concurrency error when simultaneous writes collide.

  • How to handle: Implement retry logic, reduce write contention, and optimize your schema


Popular posts from this blog

How does BGP prevent routing loops? Explain AS_PATH and loop prevention mechanisms.

 In Border Gateway Protocol (BGP), preventing routing loops is critical — especially because BGP is the inter-domain routing protocol used to connect Autonomous Systems (ASes) on the internet. 🔄 How BGP Prevents Routing Loops The main mechanism BGP uses is the AS_PATH attribute . 🔍 What is AS_PATH? AS_PATH is a BGP path attribute that lists the sequence of Autonomous Systems (AS numbers) a route has traversed. Each time a route is advertised across an AS boundary, the local AS number is prepended to the AS_PATH. Example: If AS 65001 → AS 65002 → AS 65003 is the route a prefix has taken, the AS_PATH will look like: makefile AS_PATH: 65003 65002 65001 It’s prepended in reverse order — so the last AS is first . 🚫 Loop Prevention Using AS_PATH ✅ Core Mechanism: BGP routers reject any route advertisement that contains their own AS number in the AS_PATH. 🔁 Why It Works: If a route makes its way back to an AS that’s already in the AS_PATH , that AS kno...

What’s the impact of BGP full routes on router memory and performance?

Receiving full BGP routes (i.e., the full global BGP routing table) has a significant impact on a router's memory and performance. Here's a breakdown of the key impacts: 🔧 1. Memory Usage (RAM) A full BGP table typically contains ~1 million IPv4 routes and growing (~200k+ IPv6 routes). Each BGP route consumes tens to hundreds of bytes of memory, depending on attributes (AS path, communities, etc.). This translates to hundreds of megabytes to several gigabytes of RAM just for storing the BGP RIB (Routing Information Base). The FIB (Forwarding Information Base) , which is installed into the router's hardware or kernel for actual packet forwarding, also consumes memory (especially in TCAM for hardware routers). ❗ Example A router might require 4–8 GB of RAM (or more) to comfortably handle full BGP routes with headroom for growth and stability. 🧠 2. CPU Utilization High CPU load during: Initial BGP session establishment (parsing all rout...

Explain the OSPF LSDB (Link State Database) and how SPF (Shortest Path First) algorithm works.

OSPF (Open Shortest Path First) is a link-state routing protocol , and the LSDB (Link-State Database) and SPF (Shortest Path First) algorithm are core to how OSPF calculates the best paths . Let’s break them down. 🧠 What is the OSPF LSDB (Link-State Database)? The LSDB is a map of the entire OSPF network area — each router stores a complete topology of its area. 🔍 Details: Built from LSAs (Link-State Advertisements) exchanged between routers. Contains info about: Routers and their interfaces Network segments Neighbor relationships Each OSPF router maintains an identical LSDB within the same area. ✅ Key Characteristics: Feature Description Scope One LSDB per OSPF area Source Built from received LSAs Consistency All routers in an area have identical LSDBs Purpose Used as input for SPF algorithm to calculate best paths ⚙️ How the SPF Algorithm Works in OSPF OSPF uses Dijkstra’s Shortest Path First (SPF) algorithm to compute the shortest (lowest-cost)...