<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Billion Updates per Second Using 30,000 Hierarchical In-Memory D4M Databases · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1902.00846/</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/1902.00846/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Billion Updates per Second Using 30,000 Hierarchical In-Memory D4M Databases — mentioned by espeed</title><link>https://news.ycombinator.com/item?id=20464067</link><guid isPermaLink="false">urn:hackerpapers:mention:1902.00846:20464067</guid><pubDate>Wed, 17 Jul 2019 21:11:43 GMT</pubDate><description>&lt;p&gt;There are several teams working on distributed GraphBLAS (the GraphBLAS/D4M model was designed to run on supercomputers [0]). Kepner&amp;#x27;s team at MIT is one [1]. NB: D4M was the original name before it was changed to GraphBLAS and became a standard. [0] GraphBLAS: Building Blocks For High Performance Graph Analytics https://crd.lbl.gov/news-and-publications/news/2017/graphbla... [1] A Billion Updates per Second Using 30,000 Hierarchical In-Memory D4M Databases https://arxiv.org/abs/1902.00846 http://www.mit.edu/~kepner/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1902.00846/"&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>
