1 votes 1 votes For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain? Databases databases b-tree tree + – newdreamz a1-z0 asked Jan 2, 2019 newdreamz a1-z0 492 views answer comment Share Follow See 1 comment See all 1 1 comment reply smsubham commented Jan 26, 2020 reply Follow Share 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. 0 votes 0 votes Please log in or register to add a comment.