The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
26 views

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

can anyone explain?

in Databases by Active (1.5k points) | 26 views

Please log in or register to answer this question.

Related questions

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
49,807 questions
54,713 answers
189,261 comments
79,698 users