<?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 tty</title><link>https://tty.mansuri.me/tags/databases/</link><description>Recent content in databases on tty</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Thu, 30 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://tty.mansuri.me/tags/databases/index.xml" rel="self" type="application/rss+xml"/><item><title>Apr 2026</title><link>https://tty.mansuri.me/digests/~2026-04-30/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://tty.mansuri.me/digests/~2026-04-30/</guid><description>&lt;p&gt;From skiplists to intergalactic probes.&lt;/p&gt;
&lt;p&gt;&lt;a href="https://duckdb.org/2026/04/13/announcing-duckdb-152" target="_blank" rel="noopener noreferrer"&gt;DuckDB 1.5.2: SQL database that runs on laptop, server, in the browser&lt;/a&gt;
&lt;/p&gt;
&lt;p&gt;&lt;a href="https://antithesis.com/blog/2026/skiptrees/" target="_blank" rel="noopener noreferrer"&gt;What are skiplists good for?&lt;/a&gt;
&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;Later I discovered that a skiptree is closely related to a real data structure called a skip graph, a distributed data structure based on skiplists. Which just goes to show that there is nothing new under the sun. Whatever crazy idea you have, there’s a good chance some other crazy person has already done it. Moral of the story: you never know when an exotic data structure will save you a lot of time and money.&lt;/p&gt;</description></item></channel></rss>