[prev] 32 [next]

Selection with B-Trees (cont)

For range queries (assume sorted on index attribute):

search index to find leaf node for Lo
for each leaf node entry until Hi found {
	access tuple T using tid from entry
}

Costrange  =  (D + bi + bq)r

[Diagram:Pics/file-struct/btree00.png]