492 views
1 votes
1 votes

For range queries every B+ tree index requires less I/O than a full table scan.

can anyone explain?

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
Shivani gaikawad asked Oct 27, 2018
406 views
0 votes
0 votes
1 answer
2
iarnav asked Dec 15, 2017
1,362 views
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
1 votes
1 votes
1 answer
3
6 votes
6 votes
1 answer
4
firki lama asked Jan 14, 2017
5,892 views
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...