<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Join Processing for Graph Patterns: An Old Dog with New Tricks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1503.04169/</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/1503.04169/feed.xml" rel="self" type="application/rss+xml" /><item><title>Join Processing for Graph Patterns: An Old Dog with New Tricks — mentioned by semihsalihoglu</title><link>https://news.ycombinator.com/item?id=34962576</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.04169:34962576</guid><pubDate>Mon, 27 Feb 2023 22:04:59 GMT</pubDate><description>&lt;p&gt;If you have any good ideas about how to implement Tetris in a practical way, you can make a good impact here. This is the only work that I know that tried to implement these: https://arxiv.org/pdf/1503.04169.pdf (and excitingly published at GRADES workshop at SIGMOD, which I co-chaired twice and is very dear to my heart). But I talked to the authors and they all agree that despite the tone of the paper, they found them quite difficult to implement in a performant way. So here&amp;#x27;s the problem. The core algorithmic step of &amp;quot;beyond wcojs&amp;quot; are &amp;quot;geometric resolutions&amp;quot;. The core idea is to work with…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.04169/"&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>
