https://hackerpaper.kaipfister.de/p/1905.01294/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=23286693urn:hackerpapers:mention:1905.01294:23286693Sat, 23 May 2020 21:34:22 GMT<p>RedisGraph uses GraphBLAS: https://github.com/RedisGraph/RedisGraph/ Their paper claims that computing with adjacency (sparse) matrices is more performant than alternatives: https://arxiv.org/pdf/1905.01294.pdf They compile queries written in Cypher (Neo4j&#x27;s language) to operations in linear algebra. An example query is: MATCH (n:actor{name:&quot;Nicolas Cage&quot;})-[:act]-&gt;(m:movie)&lt;-[:act]-(a:actor) RETURN a.name, m.title</p><p><a href="https://hackerpaper.kaipfister.de/p/1905.01294/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DB