Hacker News Reader

I'm only commenting because of the "job interview" comment, but when someone compares hash tables to B-trees, I usually assume (fairly or not) that they don't really know what a B-tree is.

View on HN

So what you are saying is that the whole database research community does not really know what a B-Tree is [1]?

[1] Every database implementation techniques lecture compares the two. See, e.g., http://infolab.stanford.edu/~hyunjung/cs346/.

You know that's not what I'm saying. You're just trying to assert nerd dominance.

Ah, thanks for clarifying. I had to implement a B+-tree using only a 2D byte array as a sophomore, so I don't think I'll ever be able to forget how they work.

Reply on news.ycombinator.com