<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Databases on mc · notes</title><link>https://hk.crepuscule.uk/tags/databases/</link><description>Recent content in Databases on mc · notes</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Tue, 04 Aug 2026 19:30:00 +0800</lastBuildDate><atom:link href="https://hk.crepuscule.uk/tags/databases/index.xml" rel="self" type="application/rss+xml"/><item><title>Bloom filters, and when a probabilistic set is the right call</title><link>https://hk.crepuscule.uk/posts/bloom-filters/</link><pubDate>Tue, 04 Aug 2026 19:30:00 +0800</pubDate><guid>https://hk.crepuscule.uk/posts/bloom-filters/</guid><description>Trade a little certainty for a lot of memory — the math is friendlier than it looks.</description></item></channel></rss>