Register

data base

603 views
0 votes
0 votes
Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that will fit in one node is as follows: (a) Four (b) Six (c) Eight
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
skywalker_19 asked Oct 8, 2018
681 views
Indexing
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree
How to prove that if same size blocks are allocated to B trees and B+ trees then:-No. of index nodes in B tree >= No. Of index nodes in B+ tree
User Avatar
0 votes
0 votes
1 answer
2
iarnav asked Dec 15, 2017
1,410 views
B+ Tree Question
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
User Avatar
2 votes
2 votes
1 answer
3
VS asked Dec 10, 2017
2,363 views
B+ tree 2
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
User Avatar
4 votes
4 votes
2 answers
4
Nils asked Nov 14, 2017
608 views
B+ tree
pls explain
pls explain
User Avatar
Link Copied!