Optimal query/update tradeoffs in versioned dictionaries · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1103.2566/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTOptimal query/update tradeoffs in versioned dictionaries — mentioned by jholmanhttps://news.ycombinator.com/item?id=2436076urn:hackerpapers:mention:1103.2566:2436076Tue, 12 Apr 2011 05:53:20 GMT<p>If we&#x27;re replacing blog links with arXiv abstract links, note that there are actually two papers linked, both interesting. &quot;Stratified B-trees and versioning dictionaries&quot; http://arxiv.org/abs/1103.4282 This is actually the newer paper, and presents the &quot;Stratified B-Tree&quot; data structure itself. It also explicitly mentions SSDs and appending, by the way. &quot;Optimal query/update tradeoffs in versioned dictionaries&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.</p><p><a href="https://hackerpaper.kaipfister.de/p/1103.2566/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS