<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: forgotmy_login</title><link>https://news.ycombinator.com/user?id=forgotmy_login</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 23 Jul 2026 04:20:46 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=forgotmy_login" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by forgotmy_login in "The startup's Postgres survival guide"]]></title><description><![CDATA[
<p>Recalling from my previous studies here: I think you can use Serializable Isolation Level, the strictest level - this will cause one of the two to fail (that is; fail only when the two txns affected rows that would logically conflict). And then you build the expectation of such possible transaction failures into the code and treat retries as a first-class expectation. Does this get to what you're trying to solve at all?</p>
]]></description><pubDate>Wed, 22 Jul 2026 16:29:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=49009404</link><dc:creator>forgotmy_login</dc:creator><comments>https://news.ycombinator.com/item?id=49009404</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49009404</guid></item></channel></rss>