<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Mario Noioso</title>
    <description>The latest articles on DEV Community by Mario Noioso (@manoioso).</description>
    <link>https://dev.to/manoioso</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3697252%2Fb9549deb-1a34-4450-adc1-b8e4c52ff9f7.png</url>
      <title>DEV Community: Mario Noioso</title>
      <link>https://dev.to/manoioso</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/manoioso"/>
    <language>en</language>
    <item>
      <title>TTL Indexes Are Not Records Management</title>
      <dc:creator>Mario Noioso</dc:creator>
      <pubDate>Wed, 28 Oct 2026 15:05:28 +0000</pubDate>
      <link>https://dev.to/manoioso/ttl-indexes-are-not-records-management-43ap</link>
      <guid>https://dev.to/manoioso/ttl-indexes-are-not-records-management-43ap</guid>
      <description>&lt;h2&gt;
  
  
  A TTL index deletes documents silently when a date passes. Retention of records needs holds, proof, content deletion and a stub. Here is the difference, with code.
&lt;/h2&gt;

&lt;p&gt;Every few months I meet a document platform where "retention" is implemented like this:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;documents&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;createIndex&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.retention.dispositionDue&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;expireAfterSeconds&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;})&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;One line, done. Documents disappear when their disposition date passes. It even sounds like records management.&lt;/p&gt;

&lt;p&gt;It is not, and the gap between the two is the gap between a platform that can answer an auditor and one that cannot. This post goes through what a TTL index actually does, operationally, and what a disposition run must do instead. The code is MongoDB, because that is where I work, but the argument is about any time-to-live mechanism in any store.&lt;/p&gt;

&lt;p&gt;What a TTL index does, precisely&lt;/p&gt;

&lt;p&gt;A TTL index is a single-field index on a date (or an array of dates, in which case the earliest wins) with an expireAfterSeconds option. A background thread on the primary wakes up every 60 seconds, scans each TTL index for documents whose date plus the offset is in the past, and deletes them. The thread is single-threaded, and per index per sub-pass it stops at 50,000 deletions or after one second, whichever comes first, then moves to the next index and comes back later. Since 6.1 the deletes are batched and the monitor is fair across indexes. Secondaries do nothing: they replicate the primary's deletes through the oplog.&lt;/p&gt;

&lt;p&gt;Four consequences follow directly from the documentation, and each one matters for records:&lt;/p&gt;

&lt;p&gt;No timing guarantee. The manual says it plainly: expired data is not guaranteed to be deleted immediately, and under load may persist well past expiry. For caches that is fine. For a document whose retention expired, "destroyed within the retention schedule" cannot be proven.&lt;br&gt;
No conditions. The monitor evaluates one thing, the date. It cannot check that the document is not under legal hold, that its dossier is not under hold, that the content object has no other references, or that a retention schedule was not revised last week.&lt;br&gt;
No record. The delete leaves nothing behind. db.serverStatus().metrics.ttl gives you deletedDocuments, passes and subPasses as counters, not a log of which documents went and why. A change stream sees a plain delete event, indistinguishable from a user's.&lt;br&gt;
No reach. The index deletes the metadata document. The PDF in object storage, the OCR text in the search projection, the chunks in the vector collection, the rendition cache and the export package someone produced last year are untouched.&lt;/p&gt;

&lt;p&gt;There is a fifth, subtler one: documents whose date field is missing or is not a BSON date never expire. A migration that wrote dispositionDue as a string on 3% of records has silently created 3% of records that will live forever, and nothing will tell you.&lt;/p&gt;

&lt;p&gt;What records management asks for&lt;/p&gt;

&lt;p&gt;Strip the regulatory vocabulary and a records function asks a document platform for four things at disposition time:&lt;/p&gt;

&lt;p&gt;Precondition checks that are evaluated at the moment of destruction, not when the date was computed: holds at document and dossier level, schedule still in force, approval where the schedule requires it.&lt;br&gt;
An inventory of everything that constitutes the record: every version, every rendition, every derived copy, with an outcome for each.&lt;br&gt;
Proof: a disposition record stating what was destroyed, when, under which schedule and by which run, that survives the destruction itself.&lt;br&gt;
A stub: the metadata skeleton of the document stays, so that a request five years later gets "destroyed on this date under this schedule" rather than silence.&lt;/p&gt;

&lt;p&gt;None of these can be expressed as an index option. They are a job.&lt;/p&gt;

&lt;p&gt;A disposition run that holds up&lt;/p&gt;

&lt;p&gt;Below is the shape I use in the reference design of my field guide on document management. It is a state machine in two phases. Phase one runs inside a transaction and makes the decision; phase two, outside any transaction and fully retryable, destroys content and finalizes.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="nx"&gt;javascript&lt;/span&gt;
&lt;span class="c1"&gt;// Phase 1 (transaction): re-check holds at document and dossier level inside the&lt;/span&gt;
&lt;span class="c1"&gt;// transaction, move the record to "disposing", inventory every object of every version,&lt;/span&gt;
&lt;span class="c1"&gt;// decrement reference counts, and write the disposition record.&lt;/span&gt;
&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;due&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;documents&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;find&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt;
  &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.retention.dispositionDue&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$lte&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
  &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.state&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$in&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;registered&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;closed&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
  &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.holds&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$size&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;projection&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;dossier&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.retention&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;}).&lt;/span&gt;&lt;span class="nf"&gt;limit&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;1000&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

&lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="k"&gt;await &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;d&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="nx"&gt;due&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;session&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;withTransaction&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;async &lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;dossier&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;dossiers&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;findOne&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;dossier&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;id&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;projection&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;holds&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="nx"&gt;session&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
    &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;dossier&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="nx"&gt;dossier&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;holds&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;length&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;throw&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;SkipError&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;dossier under hold&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;r&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;documents&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;updateOne&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.state&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$in&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;registered&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;closed&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
        &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.holds&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$size&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$set&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.state&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;disposing&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;current.object&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="kc"&gt;null&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
                &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;current.renditions&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;[]&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
        &lt;span class="na"&gt;$inc&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;recordVersion&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="nx"&gt;session&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
    &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;r&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;matchedCount&lt;/span&gt; &lt;span class="o"&gt;!==&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;throw&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;SkipError&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;state changed concurrently&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;versions&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;versions&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
      &lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;find&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="na"&gt;documentId&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;_id&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;projection&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;object&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;renditions&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="nx"&gt;session&lt;/span&gt; &lt;span class="p"&gt;})&lt;/span&gt;
      &lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;toArray&lt;/span&gt;&lt;span class="p"&gt;();&lt;/span&gt;
    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;keys&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;versions&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;flatMap&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;v&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="nx"&gt;v&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;object&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;key&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
                                        &lt;span class="p"&gt;...&lt;/span&gt;&lt;span class="nx"&gt;v&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;renditions&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;map&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;x&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="nx"&gt;x&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;key&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;filter&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nb"&gt;Boolean&lt;/span&gt;&lt;span class="p"&gt;)]);&lt;/span&gt;
    &lt;span class="k"&gt;for &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;v&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="nx"&gt;versions&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
      &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;objects&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;updateOne&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;
        &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;tenant&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;tenantId&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;sha256&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;v&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;object&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;sha256&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
        &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$inc&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;refs&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="nx"&gt;session&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;
    &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;dispositions&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;insertOne&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;at&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;(),&lt;/span&gt; &lt;span class="nx"&gt;runId&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="na"&gt;scheduleId&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;lifecycle&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;retention&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;scheduleId&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;action&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;d&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;lifecycle&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;retention&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;action&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="na"&gt;objects&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;keys&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;map&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;k&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="na"&gt;key&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;k&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;deletedAt&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="kc"&gt;null&lt;/span&gt; &lt;span class="p"&gt;}))&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="nx"&gt;session&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
  &lt;span class="p"&gt;}).&lt;/span&gt;&lt;span class="k"&gt;catch&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;e&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="o"&gt;!&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;e&lt;/span&gt; &lt;span class="k"&gt;instanceof&lt;/span&gt; &lt;span class="nx"&gt;SkipError&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="k"&gt;throw&lt;/span&gt; &lt;span class="nx"&gt;e&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="c1"&gt;// Phase 2 (outside any transaction, retryable, run once the longest signed-URL lifetime&lt;/span&gt;
&lt;span class="c1"&gt;// has elapsed): delete objects whose reference count is zero, then finalize the record.&lt;/span&gt;
&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;pending&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;dispositions&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;find&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;objects.deletedAt&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="kc"&gt;null&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
                                                     &lt;span class="na"&gt;at&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$lte&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;urlCutoff&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
&lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="k"&gt;await &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;disp&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="nx"&gt;pending&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="k"&gt;for &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;o&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="nx"&gt;disp&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;objects&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;filter&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;o&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="o"&gt;!&lt;/span&gt;&lt;span class="nx"&gt;o&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;deletedAt&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;obj&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;objects&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;findOne&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="na"&gt;key&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;o&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;key&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;projection&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;refs&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;shared&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="o"&gt;!!&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;obj&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="nx"&gt;obj&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;refs&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="o"&gt;!&lt;/span&gt;&lt;span class="nx"&gt;shared&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;contentStore&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;deleteObject&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;o&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;key&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;               &lt;span class="c1"&gt;// idempotent, logged&lt;/span&gt;
    &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;dispositions&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;updateOne&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;disp&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;objects.key&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;o&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;key&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$set&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;objects.$.deletedAt&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;(),&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;objects.$.shared&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;shared&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;
  &lt;span class="k"&gt;await&lt;/span&gt; &lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;collection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;documents&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;).&lt;/span&gt;&lt;span class="nf"&gt;updateOne&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;disp&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.state&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;disposing&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
    &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$set&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.state&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;disposed&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.disposedAt&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Six things in there that a TTL index cannot do:&lt;/p&gt;

&lt;p&gt;The hold check runs inside the transaction, on both document and dossier, so a hold placed one second before the run wins.&lt;br&gt;
The state transition is conditional on the current state, so a concurrent run or a concurrent re-registration makes the update match zero documents and the transaction aborts cleanly.&lt;br&gt;
Every version's objects are inventoried, not only the current one.&lt;br&gt;
Reference counts: content is keyed by hash, so two documents can share one object. The object is deleted only when the last reference goes. A TTL index on documents would happily orphan or, worse, keep content that another document's disposition later finds already gone.&lt;br&gt;
Content deletion waits for the longest signed-URL lifetime the platform issues, so a URL handed out just before the run cannot fetch destroyed content; from disposing onwards the document API refuses to issue new ones.&lt;br&gt;
The record ends in disposed with pointers removed, the disposition record attached, class and registration number intact. That is the stub.&lt;/p&gt;

&lt;p&gt;The index that serves the run is a partial one, cheap and honest about what it is:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="nx"&gt;javascript&lt;/span&gt;
&lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;documents&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;createIndex&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.retention.dispositionDue&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
  &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;partialFilterExpression&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;lifecycle.state&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;$in&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;registered&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;closed&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="p"&gt;})&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;No expireAfterSeconds. The index finds what is due; the job decides.&lt;/p&gt;

&lt;p&gt;Where TTL indexes belong in the same platform&lt;/p&gt;

&lt;p&gt;I am not arguing against TTL indexes. In the same reference design they do real work, exactly where their semantics fit:&lt;/p&gt;

&lt;p&gt;upload sessions and multipart state, expiring after a few hours;&lt;br&gt;
cached renditions and thumbnails that are regenerated on demand;&lt;br&gt;
signed-URL issuance records, which exist only to be revocable for minutes;&lt;br&gt;
dead-letter entries already reprocessed, after a grace period.&lt;/p&gt;

&lt;p&gt;The rule is simple: a TTL index is right when losing the document early, late or silently costs nothing. A record is the definition of a document for which that is false.&lt;/p&gt;

&lt;p&gt;A test you can run&lt;/p&gt;

&lt;p&gt;If you want to see the difference rather than take it on faith, this is the smallest experiment. Create a collection with a TTL index set to expire immediately, insert a document "under hold", and watch what happens.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="nx"&gt;javascript&lt;/span&gt;
&lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;ttl_demo&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;drop&lt;/span&gt;&lt;span class="p"&gt;();&lt;/span&gt;
&lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;ttl_demo&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;createIndex&lt;/span&gt;&lt;span class="p"&gt;({&lt;/span&gt; &lt;span class="na"&gt;due&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;expireAfterSeconds&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
&lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;ttl_demo&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;insertMany&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;
  &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;A&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;due&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nb"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;now&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="mi"&gt;1000&lt;/span&gt;&lt;span class="p"&gt;),&lt;/span&gt; &lt;span class="na"&gt;holds&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;LITIGATION-2026-14&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
  &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;B&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;due&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nb"&gt;Date&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;now&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="mi"&gt;1000&lt;/span&gt;&lt;span class="p"&gt;),&lt;/span&gt; &lt;span class="na"&gt;holds&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;[]&lt;/span&gt; &lt;span class="p"&gt;},&lt;/span&gt;
  &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;C&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;due&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;2026-10-01T00:00:00Z&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="na"&gt;holds&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="p"&gt;[]&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt;        &lt;span class="c1"&gt;// string, not a date&lt;/span&gt;
&lt;span class="p"&gt;]);&lt;/span&gt;
&lt;span class="c1"&gt;// wait up to ~60 s, then:&lt;/span&gt;
&lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;ttl_demo&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;find&lt;/span&gt;&lt;span class="p"&gt;({},&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="na"&gt;_id&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="p"&gt;});&lt;/span&gt;
&lt;span class="nx"&gt;db&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;serverStatus&lt;/span&gt;&lt;span class="p"&gt;().&lt;/span&gt;&lt;span class="nx"&gt;metrics&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;ttl&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;A and B are gone, hold or no hold. C is still there and will be forever. The metrics counter went up by two, and nothing in the database can tell you that A was under a litigation hold when it was destroyed. That is the whole post in six lines.&lt;/p&gt;

&lt;p&gt;This is an extract and expansion of Chapter 8 of Document Management: Metadata-Driven Search over Documents and Records, Volume 2 of Real-World Architectures, the free field guides I write on the architectural patterns that decide whether data platforms survive production. The guide covers the rest: registration with an anchored hash chain, legal hold propagation, export packages, the search layer with one permission model, and a readiness checklist. Free PDF, 51 pages: marionoioso.com/real-world-architectures/document-management. Archived with DOI 10.5281/zenodo.23691439.&lt;/p&gt;

&lt;p&gt;Views my own. The guide is an independent, non-commercial publication and is not sponsored, reviewed or endorsed by MongoDB, Inc. Code reviewed statically against MongoDB 8.0 documentation; test it in your own environment.&lt;/p&gt;

</description>
      <category>mongodb</category>
      <category>database</category>
      <category>architecture</category>
      <category>compliance</category>
    </item>
    <item>
      <title>Who Owns the Memory Owns the Future: Data, AI and the New Infrastructure of Power</title>
      <dc:creator>Mario Noioso</dc:creator>
      <pubDate>Thu, 20 Aug 2026 23:58:41 +0000</pubDate>
      <link>https://dev.to/manoioso/who-owns-the-memory-owns-the-future-data-ai-and-the-new-infrastructure-of-power-5gad</link>
      <guid>https://dev.to/manoioso/who-owns-the-memory-owns-the-future-data-ai-and-the-new-infrastructure-of-power-5gad</guid>
      <description>&lt;p&gt;I’ve just published my new book:&lt;/p&gt;

&lt;p&gt;Who Owns the Memory Owns the Future&lt;/p&gt;

&lt;p&gt;Core idea: whoever controls memory controls power. In the 21st century, memory is no longer purely human—it is stored, structured, and governed by data systems, making it a key arena of influence.&lt;/p&gt;

&lt;p&gt;This short essay on data, AI, and digital infrastructure shows how control over memory increasingly means control over society itself.&lt;/p&gt;

&lt;p&gt;From databases and AI models to cloud platforms and digital sovereignty, it exposes the invisible infrastructure shaping our future and concentrating power.&lt;/p&gt;

&lt;p&gt;👉 &lt;a href="https://amzn.eu/d/06lMYGTo" rel="noopener noreferrer"&gt;https://amzn.eu/d/06lMYGTo&lt;/a&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  AI #Data #Technology #DigitalSovereigntyquale
&lt;/h1&gt;

</description>
      <category>data</category>
      <category>ai</category>
      <category>books</category>
      <category>discuss</category>
    </item>
    <item>
      <title>[Boost]</title>
      <dc:creator>Mario Noioso</dc:creator>
      <pubDate>Fri, 14 Aug 2026 14:44:05 +0000</pubDate>
      <link>https://dev.to/manoioso/-1j13</link>
      <guid>https://dev.to/manoioso/-1j13</guid>
      <description></description>
    </item>
    <item>
      <title>MongoDB EMEA Public Sector</title>
      <dc:creator>Mario Noioso</dc:creator>
      <pubDate>Tue, 05 May 2026 16:43:16 +0000</pubDate>
      <link>https://dev.to/manoioso/mongodb-emea-public-sector-553i</link>
      <guid>https://dev.to/manoioso/mongodb-emea-public-sector-553i</guid>
      <description>&lt;p&gt;This section explores how MongoDB is used in the public sector across EMEA, covering data platforms, AI use cases, and sovereign cloud strategies. It provides insights into public sector data architectures, AI adoption, and digital sovereignty initiatives across Europe, Turkey and the Gulf region. From national digital platforms to large-scale public services, this collection highlights how modern data infrastructure is reshaping the public sector.&lt;/p&gt;

&lt;p&gt;Explore all articles in the &lt;a href="https://marionoioso.com/category/public-sector/" rel="noopener noreferrer"&gt;MongoDB Public Sector EMEA&lt;/a&gt; series.&lt;/p&gt;

&lt;p&gt;Topics covered in this section include:&lt;/p&gt;

&lt;p&gt;– MongoDB in government and public sector architectures&lt;br&gt;
– Public sector data platforms and modernization strategies&lt;br&gt;
– AI adoption in public institutions&lt;br&gt;
– Sovereign cloud and data residency in EMEA&lt;br&gt;
– Digital identity and large-scale public services&lt;/p&gt;

</description>
      <category>ai</category>
      <category>mongodb</category>
      <category>database</category>
    </item>
    <item>
      <title>Production AI is not a demo: lessons learned building real GenAI systems with MongoDB</title>
      <dc:creator>Mario Noioso</dc:creator>
      <pubDate>Thu, 22 Jan 2026 18:11:18 +0000</pubDate>
      <link>https://dev.to/manoioso/production-ai-is-not-a-demo-lessons-learned-building-real-genai-systems-with-mongodb-44an</link>
      <guid>https://dev.to/manoioso/production-ai-is-not-a-demo-lessons-learned-building-real-genai-systems-with-mongodb-44an</guid>
      <description>&lt;p&gt;In the last year, I’ve seen a pattern repeat itself again and again.&lt;/p&gt;

&lt;p&gt;AI demos look impressive.&lt;br&gt;
Production AI systems behave very differently.&lt;/p&gt;

&lt;p&gt;Once you move beyond notebooks and prototypes, the real challenges emerge: data consistency, latency, hybrid search, lifecycle management, and the uncomfortable gap between “it works” and “it works reliably”.&lt;/p&gt;

&lt;p&gt;While working on real-world AI platforms (public sector, large document repositories, search-heavy systems), I ended up converging on a few hard truths:&lt;br&gt;
    • Retrieval is the core of GenAI, not the model&lt;br&gt;
    • Vector search alone is rarely enough&lt;br&gt;
    • Data architecture matters more than prompt engineering&lt;br&gt;
    • Production AI fails quietly when observability is ignored&lt;/p&gt;

&lt;p&gt;MongoDB turned out to be a surprisingly strong foundation for these systems, not because of hype, but because it sits naturally at the intersection of operational data, search, and AI workloads.&lt;/p&gt;

&lt;p&gt;I recently wrote a deeper piece where I walk through:&lt;br&gt;
    • what “production AI” actually means&lt;br&gt;
    • why hybrid search (full-text + semantic) is essential&lt;br&gt;
    • how to structure data and embeddings without painting yourself into a corner&lt;br&gt;
    • the architectural mistakes I see teams repeat&lt;/p&gt;

&lt;p&gt;I expand these ideas in more detail in &lt;a href="https://marionoioso.com/2026/01/16/production-ai-with-mongodb/" rel="noopener noreferrer"&gt;Production AI with MongoDB&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;This is not a tutorial and not marketing.&lt;br&gt;
It’s a field report from systems that had to survive real users, real data, and real constraints.&lt;/p&gt;

&lt;p&gt;If you’re building GenAI systems meant to last longer than a demo, I hope it helps you avoid a few expensive mistakes.&lt;/p&gt;

</description>
      <category>ai</category>
      <category>mongodb</category>
      <category>architecture</category>
      <category>genai</category>
    </item>
    <item>
      <title>Arcana: an agentic AI system for reasoning about MongoDB architectures</title>
      <dc:creator>Mario Noioso</dc:creator>
      <pubDate>Wed, 07 Jan 2026 00:30:38 +0000</pubDate>
      <link>https://dev.to/manoioso/arcana-an-agentic-ai-system-for-reasoning-about-mongodb-architectures-d6d</link>
      <guid>https://dev.to/manoioso/arcana-an-agentic-ai-system-for-reasoning-about-mongodb-architectures-d6d</guid>
      <description>&lt;p&gt;Most AI tools today are optimized for conversation.&lt;/p&gt;

&lt;p&gt;Arcana is not.&lt;/p&gt;

&lt;p&gt;Arcana is an &lt;strong&gt;agentic AI system&lt;/strong&gt; designed to reason about real-world data architectures, with a strong focus on MongoDB-based systems.&lt;/p&gt;

&lt;h2&gt;
  
  
  The problem Arcana tries to solve
&lt;/h2&gt;

&lt;p&gt;Modern systems are no longer just “an app plus a database”.&lt;/p&gt;

&lt;p&gt;They are:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;distributed&lt;/li&gt;
&lt;li&gt;data-intensive&lt;/li&gt;
&lt;li&gt;AI-augmented&lt;/li&gt;
&lt;li&gt;continuously evolving&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;In these environments, architectural decisions around:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;data modeling&lt;/li&gt;
&lt;li&gt;sharding&lt;/li&gt;
&lt;li&gt;workload isolation&lt;/li&gt;
&lt;li&gt;multi-region design&lt;/li&gt;
&lt;li&gt;AI integration&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;do not have single correct answers.&lt;/p&gt;

&lt;p&gt;They require reasoning, trade-offs, and context.&lt;/p&gt;

&lt;h2&gt;
  
  
  Why Arcana is agentic by design
&lt;/h2&gt;

&lt;p&gt;Arcana follows an agent-first approach:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;interactions start from &lt;strong&gt;intent&lt;/strong&gt;, not chat history
&lt;/li&gt;
&lt;li&gt;documents and data are &lt;strong&gt;inputs to reasoning&lt;/strong&gt;, not final answers
&lt;/li&gt;
&lt;li&gt;the agent accumulates context while exploring a problem space
&lt;/li&gt;
&lt;li&gt;outputs are structured to support decisions, not just explanations
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;This makes Arcana closer to a &lt;strong&gt;technical collaborator&lt;/strong&gt; than to a Q&amp;amp;A system.&lt;/p&gt;

&lt;h2&gt;
  
  
  MongoDB as a knowledge substrate
&lt;/h2&gt;

&lt;p&gt;MongoDB plays a central role in Arcana’s design.&lt;/p&gt;

&lt;p&gt;It acts as:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;a system of record&lt;/li&gt;
&lt;li&gt;a document and metadata store&lt;/li&gt;
&lt;li&gt;a semantic retrieval layer&lt;/li&gt;
&lt;li&gt;an architectural boundary&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;This makes it a natural foundation for agentic systems that need to reason over both structured and unstructured knowledge.&lt;/p&gt;

&lt;h2&gt;
  
  
  Not a shortcut generator
&lt;/h2&gt;

&lt;p&gt;Arcana is not:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;a generic LLM wrapper&lt;/li&gt;
&lt;li&gt;a prompt playground&lt;/li&gt;
&lt;li&gt;a FAQ system&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;It does not replace engineering judgment.&lt;br&gt;
It exists to support it.&lt;/p&gt;

&lt;h2&gt;
  
  
  More details
&lt;/h2&gt;

&lt;p&gt;A more detailed overview of Arcana’s architecture and philosophy is available here:&lt;/p&gt;

&lt;p&gt;👉 &lt;a href="https://marionoioso.com/2025/12/28/arcana-a-knowledge-engine-for-grounded-ai-systems/" rel="noopener noreferrer"&gt;Arcana – A Knowledge Engine for Grounded AI Systems&lt;/a&gt;&lt;/p&gt;

</description>
      <category>mongodb</category>
      <category>ai</category>
      <category>architecture</category>
      <category>llm</category>
    </item>
    <item>
      <title>MongoDB MCP Server: exposing database knowledge to reasoning agents</title>
      <dc:creator>Mario Noioso</dc:creator>
      <pubDate>Wed, 07 Jan 2026 00:25:16 +0000</pubDate>
      <link>https://dev.to/manoioso/mongodb-mcp-server-exposing-database-knowledge-to-reasoning-agents-23j3</link>
      <guid>https://dev.to/manoioso/mongodb-mcp-server-exposing-database-knowledge-to-reasoning-agents-23j3</guid>
      <description>&lt;p&gt;Modern AI systems are good at talking.&lt;br&gt;
They are less good at reasoning over real system knowledge.&lt;/p&gt;

&lt;p&gt;When you build AI agents that need to reason about architectures, data models, or production constraints, the problem is not “retrieval”.&lt;br&gt;
The problem is &lt;strong&gt;controlled context exposure&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;This is where the MCP (Model Context Protocol) pattern becomes interesting.&lt;/p&gt;

&lt;h2&gt;
  
  
  MCP in a nutshell
&lt;/h2&gt;

&lt;p&gt;An MCP server exposes structured knowledge to AI agents in a &lt;strong&gt;protocol-driven way&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;Instead of:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;stuffing documents into prompts&lt;/li&gt;
&lt;li&gt;or relying on raw vector search output&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;the agent interacts with a server that:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;knows the domain&lt;/li&gt;
&lt;li&gt;controls what context is exposed&lt;/li&gt;
&lt;li&gt;supports reasoning, not just answers&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Why MongoDB fits naturally
&lt;/h2&gt;

&lt;p&gt;MongoDB already acts as:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;a system of record&lt;/li&gt;
&lt;li&gt;a document store&lt;/li&gt;
&lt;li&gt;a semantic retrieval layer&lt;/li&gt;
&lt;li&gt;an architectural boundary&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;An MCP server backed by MongoDB can expose:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;data models&lt;/li&gt;
&lt;li&gt;architectural constraints&lt;/li&gt;
&lt;li&gt;documentation&lt;/li&gt;
&lt;li&gt;operational knowledge&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;as &lt;strong&gt;reasoning-ready context&lt;/strong&gt; for agents.&lt;/p&gt;

&lt;h2&gt;
  
  
  This is not a chatbot pattern
&lt;/h2&gt;

&lt;p&gt;The goal is not better conversations.&lt;br&gt;
The goal is better decisions.&lt;/p&gt;

&lt;p&gt;Agents reasoning over MongoDB-backed knowledge can:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;explore trade-offs&lt;/li&gt;
&lt;li&gt;accumulate context&lt;/li&gt;
&lt;li&gt;produce structured, actionable outputs&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Further details
&lt;/h2&gt;

&lt;p&gt;I wrote a deeper technical breakdown of how a MongoDB MCP Server works, including architecture and design considerations here:&lt;/p&gt;

&lt;p&gt;👉 &lt;a href="https://marionoioso.com/2026/01/06/mongodb-mcp-server/" rel="noopener noreferrer"&gt;MongoDB MCP Server&lt;/a&gt;&lt;/p&gt;

</description>
      <category>mongodb</category>
      <category>ai</category>
      <category>architecture</category>
      <category>llm</category>
    </item>
  </channel>
</rss>
