<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Stratified B-trees and versioning dictionaries · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1103.4282/</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/1103.4282/feed.xml" rel="self" type="application/rss+xml" /><item><title>Stratified B-trees and versioning dictionaries — HN submission</title><link>https://news.ycombinator.com/item?id=16085391</link><guid isPermaLink="false">urn:hackerpapers:submission:1103.4282:16085391</guid><pubDate>Sat, 06 Jan 2018 14:30:00 GMT</pubDate><description>&lt;p&gt;Stratified B-trees and versioning dictionaries&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1103.4282/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Stratified B-trees and versioning dictionaries — mentioned by eyan</title><link>https://news.ycombinator.com/item?id=11611842</link><guid isPermaLink="false">urn:hackerpapers:mention:1103.4282:11611842</guid><pubDate>Mon, 02 May 2016 14:57:41 GMT</pubDate><description>&lt;p&gt;Every time I come across a new KV store, I go out looking for an userland implementation from the Acunu guys: http://arxiv.org/abs/1103.4282. So far, none seen yet. I&amp;#x27;d like to see Stratified B Trees kick LSMs&amp;#x27; butts. Or the other way around. I can&amp;#x27;t code this yet. But I can hope that somebody&amp;#x27;s already on to this. Need to mention Percona&amp;#x27;s take on this space too: https://github.com/percona/PerconaFT. The patent notice makes it scary tho.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1103.4282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Stratified B-trees and versioning dictionaries — HN submission</title><link>https://news.ycombinator.com/item?id=2437392</link><guid isPermaLink="false">urn:hackerpapers:submission:1103.4282:2437392</guid><pubDate>Tue, 12 Apr 2011 14:41:41 GMT</pubDate><description>&lt;p&gt;Stratified B-trees and versioning dictionaries - future FSs will kick ass&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1103.4282/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Stratified B-trees and versioning dictionaries — mentioned by chalst</title><link>https://news.ycombinator.com/item?id=2436140</link><guid isPermaLink="false">urn:hackerpapers:mention:1103.4282:2436140</guid><pubDate>Tue, 12 Apr 2011 06:21:02 GMT</pubDate><description>&lt;p&gt;Right, but the blog post does give a second reference. I prefer giving the Arxiv abstract list, which always links to the current version of the PDF. http://arxiv.org/abs/1103.4282&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1103.4282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Stratified B-trees and versioning dictionaries — mentioned by jholman</title><link>https://news.ycombinator.com/item?id=2436076</link><guid isPermaLink="false">urn:hackerpapers:mention:1103.4282:2436076</guid><pubDate>Tue, 12 Apr 2011 05:53:20 GMT</pubDate><description>&lt;p&gt;If we&amp;#x27;re replacing blog links with arXiv abstract links, note that there are actually two papers linked, both interesting. &amp;quot;Stratified B-trees and versioning dictionaries&amp;quot; http://arxiv.org/abs/1103.4282 This is actually the newer paper, and presents the &amp;quot;Stratified B-Tree&amp;quot; data structure itself. It also explicitly mentions SSDs and appending, by the way. &amp;quot;Optimal query/update tradeoffs in versioned dictionaries&amp;quot; http://arxiv.org/abs/1103.2566 This is a longer and more, shall I say, academic paper. It appears to be incompletely finished, though, because it has a TODO, and also a marginal FIXME.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1103.4282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Stratified B-trees and versioning dictionaries — mentioned by wnoise</title><link>https://news.ycombinator.com/item?id=2435697</link><guid isPermaLink="false">urn:hackerpapers:mention:1103.4282:2435697</guid><pubDate>Tue, 12 Apr 2011 03:13:50 GMT</pubDate><description>&lt;p&gt;I strongly prefer links to the abstract: http://arxiv.org/abs/1103.4282v2 This lets you: (a) read the abstract before deciding whether or not to read the paper (b) easily find earlier (or later) versions of the paper (c) easily search for other papers the authors have on the arxiv.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1103.4282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
