<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Push vs. Pull-Based Loop Fusion in Query Engines · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1610.09166/</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/1610.09166/feed.xml" rel="self" type="application/rss+xml" /><item><title>Push vs. Pull-Based Loop Fusion in Query Engines — mentioned by foldU</title><link>https://news.ycombinator.com/item?id=27010877</link><guid isPermaLink="false">urn:hackerpapers:mention:1610.09166:27010877</guid><pubDate>Sat, 01 May 2021 23:24:02 GMT</pubDate><description>&lt;p&gt;Both the linked papers (Neumann[0] and Shaikhha et al[1]) go into this a bit. I personally found figures 3 and 4 in the Neumann paper particularly helpful. [0] https://www.vldb.org/pvldb/vol4/p539-neumann.pdf [1] https://arxiv.org/pdf/1610.09166.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1610.09166/"&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>
