I hope this is in the right section. It's more of a generic indexing structure question, but I felt it went pretty well in the databases section.
My question comes from a question my professor asked me earlier this week. We have been studying B+-Trees and can see how they are efficient at insertion and deletion in certain conditions.
Typically I think of using a tree when I want to find a distinct value.
HOWEVER, my professor asked me how many instructions it would take to process a query for something like 'values less than x'.
So I have just hotlinked a google image and was hoping someone could expain this to me
if I wanted to find all the values less than 7 in this B+tree, would it take two operations to get to the leaf nodes, and another operation to travel through each leaf node until the value is not less than 7?
Hopefully someone can help out because I know this sort of thing is going to be on my final.
This post has been edited by killnine: 09 December 2008 - 09:18 AM