<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>FAQ: Questions Asked Frequently · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1504.04044/</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/1504.04044/feed.xml" rel="self" type="application/rss+xml" /><item><title>FAQ: Questions Asked Frequently — mentioned by frankmcsherry</title><link>https://news.ycombinator.com/item?id=15438048</link><guid isPermaLink="false">urn:hackerpapers:mention:1504.04044:15438048</guid><pubDate>Mon, 09 Oct 2017 22:44:07 GMT</pubDate><description>&lt;p&gt;For further reading about the high quality of database query optimization, and how far back MR et al must have set things, recent SIGMOD work managed to get to within 1000x of a single-threaded implementation (and so, not quite within that of data-parallel systems): https://github.com/frankmcsherry/blog/blob/master/posts/2017... I don&amp;#x27;t use databases because they are really quite bad at computation. In my opinion, the main recent novelty in query planning has been the work on worst-case optimal joins, stuff like EmptyHeaded[1] and the recent FAQ work[2]. [1]: https://arxiv.org/abs/1503.02368…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1504.04044/"&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>
