<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Optimistic-Locking - Tag - Tonderai Khatai</title><link>https://tldkhatai.com/tags/optimistic-locking/</link><description>Optimistic-Locking - Tag - Tonderai Khatai</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Tue, 06 Oct 2026 00:02:00 +0100</lastBuildDate><atom:link href="https://tldkhatai.com/tags/optimistic-locking/" rel="self" type="application/rss+xml"/><item><title>Compare-and-Swap Updates in PostgreSQL, Explained</title><link>https://tldkhatai.com/posts/postgres-cas-explained/</link><pubDate>Tue, 06 Oct 2026 00:02:00 +0100</pubDate><author>Tonderai Khatai</author><guid>https://tldkhatai.com/posts/postgres-cas-explained/</guid><description><![CDATA[<div class="featured-image">
                <img src="/images/posts/postgres-cas-explained.png" referrerpolicy="no-referrer">
            </div><p>Compare-and-swap means: change this row, but only if it is still what I last saw. In SQL that&rsquo;s an <code>UPDATE</code> with a guard in the <code>WHERE</code> clause, and you check how many rows it touched.</p>]]></description></item></channel></rss>