<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sorting improves word-aligned bitmap indexes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0901.3751/</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/0901.3751/feed.xml" rel="self" type="application/rss+xml" /><item><title>Sorting improves word-aligned bitmap indexes — mentioned by mtanski</title><link>https://news.ycombinator.com/item?id=11577265</link><guid isPermaLink="false">urn:hackerpapers:mention:0901.3751:11577265</guid><pubDate>Wed, 27 Apr 2016 01:47:27 GMT</pubDate><description>&lt;p&gt;Sorting esp. if your data has some kind of natural sort order can increase compression (in columnar stores), decrease index size (bitmap or fancy bitmap indexes) or lower query execution time (data is cluster vs random read). Here&amp;#x27;s one paper: Sorting improves word-aligned bitmap indexes, http://arxiv.org/abs/0901.3751&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0901.3751/"&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>
