<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>COST of Graph Processing Using Actors · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2301.01395/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Fri, 06 Nov 2026 05:38:49 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2301.01395/feed.xml" rel="self" type="application/rss+xml" /><item><title>COST of Graph Processing Using Actors — mentioned by adsharma</title><link>https://news.ycombinator.com/item?id=50388235</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.01395:50388235</guid><pubDate>Fri, 06 Nov 2026 04:33:28 GMT</pubDate><description>&lt;p&gt;Distributed actors are also good platforms to run graph algorithms. We&amp;#x27;re evaluating Rivet as a potential substrate to run page rank and clustering algorithms on large graphs, while supporting cypher queries over the result. https://github.com/orgs/Latentpedia/discussions/4 Related work: https://sigmodrecord.org/publications/sigmodRecord/1712/pdfs... https://arxiv.org/abs/2301.01395&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.01395/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
