<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Linear Algebraic Approach to Datalog Evaluation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1608.00139/</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/1608.00139/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Linear Algebraic Approach to Datalog Evaluation — mentioned by nisa</title><link>https://news.ycombinator.com/item?id=39107160</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.00139:39107160</guid><pubDate>Tue, 23 Jan 2024 18:09:32 GMT</pubDate><description>&lt;p&gt;Wow 6 volumes. Added to the list. German is also fine if there is literature and I&amp;#x27;m trying to work on my math understanding. I also found some interesting papers that solve i.e. datalog using matrices with algebraic methods. https://arxiv.org/abs/1608.00139 Guess I&amp;#x27;ll start slowly and see how far I come. Thanks!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.00139/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>A Linear Algebraic Approach to Datalog Evaluation — mentioned by espeed</title><link>https://news.ycombinator.com/item?id=19610139</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.00139:19610139</guid><pubDate>Mon, 08 Apr 2019 23:22:46 GMT</pubDate><description>&lt;p&gt;Hi Michel - You&amp;#x27;re working on a GraphBLAS Postgres implementation [0] -- here&amp;#x27;s an open question I&amp;#x27;ve been pondering... [0] Postgres GraphBLAS https://github.com/michelp/pggraphblas Now that we have SOTA linear algebra models for graphs [1], logic [2] and the lambda calculus [3] that are being optimized for vectorized parallel compute on modern CPU/GPU/TPUs -- do we have the makings for a unified linear algebra model that obsoletes the relational algebra model in relational DBs? [1] Graph Algorithms in the Language of Linear Algebra (2011)…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.00139/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>A Linear Algebraic Approach to Datalog Evaluation — mentioned by espeed</title><link>https://news.ycombinator.com/item?id=18797222</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.00139:18797222</guid><pubDate>Mon, 31 Dec 2018 21:43:20 GMT</pubDate><description>&lt;p&gt;And it&amp;#x27;s not just graphs...as referenced in the linked comments above, there are now linear algebra models that encode Datalog and/or the entire typed-lambda calculus as linear algebra matrix operations (and as shown in the Datalog paper [1], the Datalog linear algebra implementation is the fastest Datalog implementation to date). But MIT and Sandia Labs are taking the linear algebra model to the next level, and are now working on encoding an entire operating system in the language of linear algebra... Jeremy Kepner (the head of MIT Lincoln Labs and GraphBLAS lead) and his team just published…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.00139/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>A Linear Algebraic Approach to Datalog Evaluation — mentioned by espeed</title><link>https://news.ycombinator.com/item?id=18770905</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.00139:18770905</guid><pubDate>Thu, 27 Dec 2018 17:26:53 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s a new Datalog [1] implementation written in the language of linear algebra (similar in nature to the ideas behind GraphBLAS [2] &amp;quot;graph algorithms in the language of linear algebra&amp;quot;). Evidently the linear-algebra approach works well for Datalog too -- the paper below shows it&amp;#x27;s the fastest Datalog implementation to date, several orders faster than the best Prolog engines. NB: GraphBLAS runs in the recently-released RedisGraph. The Datalog linear-algebra approach is so close to simi-ring primitives in GraphBLAS. A Datalog implementation on GraphBLAS could be slick as hell. The GraphBLAS…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.00139/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>A Linear Algebraic Approach to Datalog Evaluation — HN submission</title><link>https://news.ycombinator.com/item?id=18580870</link><guid isPermaLink="false">urn:hackerpapers:submission:1608.00139:18580870</guid><pubDate>Sun, 02 Dec 2018 04:50:30 GMT</pubDate><description>&lt;p&gt;A Linear Algebraic Approach to Datalog Evaluation (2017) [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1608.00139/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
