<?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>cost-based-optimizer on Sparse Notes</title>
    <link>https://sparsenotes.com/tags/cost-based-optimizer/</link>
    <description>Recent content in cost-based-optimizer on Sparse Notes</description>
    <image>
      <url>https://sparsenotes.com/images/og-default.png</url>
      <link>https://sparsenotes.com/images/og-default.png</link>
    </image>
    <generator>Hugo -- gohugo.io</generator>
    <lastBuildDate>Sat, 14 Nov 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/tags/cost-based-optimizer/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Access Path Selection in a Relational Database Management System (Selinger et al., 1979)</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/access-path-selection-selinger-1979/</link>
      <pubDate>Sat, 14 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/access-path-selection-selinger-1979/</guid>
      <description>Seminal paper of the week: the System R optimizer paper that made SQL practical. Pat Selinger and colleagues combined a cost formula, selectivity estimates from catalog statistics, and dynamic programming over join orders with &amp;#39;interesting orders&amp;#39;. Nearly every relational optimizer since has used the same structure.</description>
    </item>
    
  </channel>
</rss>
