<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>When In-Memory Computing is Slower than Heavy Disk Usage · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1503.02678/</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.02678/feed.xml" rel="self" type="application/rss+xml" /><item><title>When In-Memory Computing is Slower than Heavy Disk Usage — mentioned by dalke</title><link>https://news.ycombinator.com/item?id=9351704</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.02678:9351704</guid><pubDate>Thu, 09 Apr 2015 23:30:59 GMT</pubDate><description>&lt;p&gt;This is not interesting. If you read the comments you&amp;#x27;ll see people complaining that it compared an O(N^2) string append method to an O(N) disk append method. Plus, the link to the research PDF in the Slashdot article is now broken. It should be http://arxiv.org/abs/1503.02678 &amp;quot;When In-Memory Computing is Slower than Heavy Disk Usage&amp;quot;. That page comments &amp;quot;This paper has been withdrawn by the authors for personal reasons. No further revisions&amp;quot;&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.02678/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.OH</category></item></channel></rss>
