Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

A B-tree does in fact have >2 children for only a single dimension.


Right. But that is more to optimize cache/block reads, right? Been way too long since I've looked at many of those details. :)


Yeah pretty much, a node in a B-Tree is designed to fill a single page of memory




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: