1,891 views
2 votes
2 votes
Which of the following statement is true for B tree and B+ tree index?

(a). B tree index is faster for range queries than B+ tree index.

(b). If disk block allocated for B+ tree index and the same size disk block is allocated for B tree index, then number of index blocks and I/O cost of B+ tree index is less than or equal to B tree index for given distinct keys.

(c). If disk block allocated for B+ tree index and the same size disk block is allocated for B tree index, then B tree index access cost is less than or equal to B+ tree for given distinct keys.

(d). If number of keys that can be stored in B tree and B+ tree index is same, then I/O cost of B+ tree index is less than or equal to I/O cost of B tree index for random access of same key from set of distinct keys.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Mrityudoot asked Jan 12
128 views
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
0 votes
0 votes
1 answer
2
1 votes
1 votes
1 answer
3
Sajal Mallick asked Nov 5, 2023
336 views
Unique not null is equivalent to primary key.Relational Algebra and SQL has same expressive power.Which of the above statements are False?
2 votes
2 votes
1 answer
4
kaustubh7 asked Sep 20, 2023
401 views
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values.FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of f...