Skip to main content

You get the error "Operation not permitted on a capped collection". What might be the issue?

The error "Operation not permitted on a capped collection" in MongoDB means you're trying to perform an operation that is not allowed on a capped collection — a special type of collection with strict constraints.

You get the error "Operation not permitted on a capped collection". What might be the issue?

🧾 What Is a Capped Collection?

A capped collection in MongoDB is:

  • Fixed-size (in bytes or number of documents).

  • FIFO (First-In-First-Out) — old documents are automatically overwritten when the size limit is reached.

  • Insert-only — documents are inserted in the order received and are not allowed to be deleted or modified in a way that changes their size.

⚠️ Common Causes of This Error

1. Trying to Delete Documents

Capped collections do not allow deletes:

db.cappedCollection.deleteOne({ status: "inactive" }) // ❌ Throws: Operation not permitted on a capped collection

2. Trying to Update Documents to a Larger Size

You cannot increase the size of a document in a capped collection:

db.cappedCollection.updateOne( { _id: 1 }, { $set: { longText: "new large content that increases size" } } ) // ❌ Throws the same error

3. Running Unsupported Operations

Some operations like remove(), certain update() forms, and findAndModify() with document resizing are disallowed.

✅ How to Fix It

✅ 1. Avoid Deletes or Size-Increasing Updates

  • Only use inserts or in-place updates that do not increase the document size.

  • Keep document structure fixed.

Example of a safe update:


db.cappedCollection.updateOne( { _id: 1 }, { $set: { status: "active" } } // Only changing value, not increasing size )

✅ 2. Use a Non-Capped Collection If You Need Flexibility

If you need to:

  • Delete documents

  • Grow documents

  • Perform flexible queries and updates

Then convert to a normal collection.

You can't un-cap a collection, but you can do this:


// Step 1: Create a new normal collection db.createCollection("newCollection") // Step 2: Copy data over db.cappedCollection.find().forEach(doc => db.newCollection.insert(doc)) // Step 3: Drop the capped collection (if needed) db.cappedCollection.drop()

✅ 3. Check If Collection Is Capped

Use this command:

db.collectionName.isCapped()

Returns true if the collection is capped.

🧠 Summary Table

ActionCapped Collection Allowed?
Insert✅ Yes
In-place update (no size change)✅ Yes
Update that increases size❌ No
Delete documents❌ No
remove() or deleteOne()❌ No

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)...