TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Modern B-Tree Techniques (2011)

314 pointsby pointy_hatover 7 years ago

5 comments

makmanalpover 7 years ago
For those who don&#x27;t know, Goetz Graefe is sort of the patron saint of btrees. He recently won the Sigmod Codd innovations award for his contributions:<p><a href="https:&#x2F;&#x2F;sigmod.org&#x2F;sigmod-awards&#x2F;people&#x2F;goetz-graefe-2017-sigmod-edgar-f-codd-innovations-award&#x2F;" rel="nofollow">https:&#x2F;&#x2F;sigmod.org&#x2F;sigmod-awards&#x2F;people&#x2F;goetz-graefe-2017-si...</a><p>He also has a lot to say about locking in B-trees:<p><a href="http:&#x2F;&#x2F;15721.courses.cs.cmu.edu&#x2F;spring2016&#x2F;papers&#x2F;a16-graefe.pdf" rel="nofollow">http:&#x2F;&#x2F;15721.courses.cs.cmu.edu&#x2F;spring2016&#x2F;papers&#x2F;a16-graefe...</a>
cryptonectorover 7 years ago
&gt; Probably the strongest arguments for B-trees over hash indexes pertain to multi-field indexes and to nonuniform distributions of key values. A hash index on multiple fields requires search keys for all those fields such that a hash value can be calculated. A B-tree index, on the other hand, can efficiently support exact-match queries for a prefix of the index key, i.e., any number of leading index fields<p>Yes, well, if none of the columns&#x2F;fields in the index are sufficiently selective, then the ability to search a B-tree by prefix may not do you much good. Don&#x27;t get me wrong though: I fully agree with all of the given reasons for B-tree superiority to hash tables.<p>Although the newest storage technologies (particularly very fast byte-addressable NVMs) -- too new for TFA -- might well change things. When you have fast byte-addressable storage it will pay to not read pages, and hash tables may yet involve fewer accesses than B-trees in that case, though I suspect B-trees will successfully adapt anyways.
评论 #15413211 未加载
评论 #15413319 未加载
评论 #15413634 未加载
hyc_symasover 7 years ago
Well, it&#x27;s an interesting survey. I&#x27;m surprised at how much space it devoted to illustrating B-trees in the context of RDBMSs as a lot of the concepts there really had no specific connection to B-trees.<p>So much space devoted to logging, locking and latches. All heavily used in the industry up till the last decade. All obsolete now. Not a single mention of immutable&#x2F;persistent B-trees. Were there really no academic papers on the topic written in a time covered by this survey?
mistercowover 7 years ago
This is from 2011, in case you missed that. I was confused by sentences like:<p>&gt;Flash memory, flash devices, and other solid state storage technology are about to change the memory hierarchy in computer systems in general and in data management in particular.<p>until I looked up at the publication date.
评论 #15410756 未加载
bootcatover 7 years ago
Really good read ! Must read for people who like algorithms and competitive programming !