<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Reordering Rows for Better Compression: Beyond the Lexicographic Order · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1207.2189/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1207.2189/feed.xml" rel="self" type="application/rss+xml" /><item><title>Reordering Rows for Better Compression: Beyond the Lexicographic Order — mentioned by gopalv</title><link>https://news.ycombinator.com/item?id=50190310</link><guid isPermaLink="false">urn:hackerpapers:mention:1207.2189:50190310</guid><pubDate>Thu, 22 Oct 2026 02:10:18 GMT</pubDate><description>&lt;p&gt;&amp;gt; does duckdb support querying custom storage formats? No, this is still parquet being loaded in. The &amp;quot;trick&amp;quot; is running through sort order combinations which result in maximum packing in a Dremel style data format (like Parquet). Here&amp;#x27;s the trick explained in enough detail to understand, but not enough to copy as-is https://cloud.google.com/blog/products/bigquery/inside-capac... Search for the section with &amp;quot;Capacitor builds an approximation model that takes into account all relevant factors and comes up with a reasonable solution.&amp;quot; or a more detailed dive in the paper (by the favourite…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1207.2189/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item></channel></rss>
