<?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>weekly-papers-2026-11-14 on Sparse Notes</title>
    <link>https://sparsenotes.com/series/weekly-papers-2026-11-14/</link>
    <description>Recent content in weekly-papers-2026-11-14 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/series/weekly-papers-2026-11-14/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>
    
    <item>
      <title>Raven: Towards Unified File Management for Data Lakehouse Systems</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/raven-unified-file-management-lakehouse/</link>
      <pubDate>Sat, 14 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/raven-unified-file-management-lakehouse/</guid>
      <description>University of Maryland and Dolby put a lakehouse catalog&amp;#39;s transactional metadata (which files are visible, who references them) in Postgres and leave the bulky per-file statistics in Iceberg or Delta Lake. That one split gives cheaper small commits, multi-table snapshot-isolation transactions, and reachability-based garbage collection that won&amp;#39;t delete files a clone or a running job still needs.</description>
    </item>
    
    <item>
      <title>Unbundling Multimodal Vision Encoding</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/unbundling-multimodal-vision-encoding/</link>
      <pubDate>Sat, 14 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/unbundling-multimodal-vision-encoding/</guid>
      <description>Meta FAIR and NYU split the vision encoder into three separate design choices (a pretrained prior, dedicated vision parameters, and placement before fusion) and test each one with every model trained from scratch at matched compute. Only the dedicated parameters matter, and they work just as well as vision-only branches inside the first eight layers of the language model.</description>
    </item>
    
    <item>
      <title>Weekly CS Paper Digest — 7 – 13 November 2026</title>
      <link>https://sparsenotes.com/posts/2026/11/papers/</link>
      <pubDate>Sat, 14 Nov 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/11/papers/</guid>
      <description>This week&amp;#39;s picks: Meta FAIR and NYU&amp;#39;s controlled study showing vision-language models need dedicated vision parameters but not a pretrained encoder; Raven, a lakehouse catalog that puts file visibility in Postgres and leaves statistics in Iceberg and Delta; and Selinger et al.&amp;#39;s 1979 System R optimizer paper as the seminal pick.</description>
    </item>
    
  </channel>
</rss>
