The Gateway to Computer Science Excellence
0 votes
63 views

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

can anyone explain?

in Databases by | 63 views
0
We can to leaf node from where our range begins. Then with each block access (remember leaf has pointer to next leaf in B+ tree) we can handle the range queries. So we don't have to scan entire table.

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,315 questions
60,426 answers
201,749 comments
95,226 users