# Recent questions tagged bplustrees

1
2
https://gateoverflow.in/91199/gate1989-12a 34 should go up right? or we have choice to move either 34 or 50 up?
3
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
1 vote
4
Consider a block of a size such that it can hold: • either 5 records of a relation R, or • be used as a B+ tree internal node with degree 11, or • B+ tree leaf node with degree 10. If R has 1000 records, then the smallest number of blocks that could be used to store R and a sparse B+ tree index on key of R is ________.
1 vote
5
Consider the following $B^+$ tree with the order of internal and leaf nodes as $3$ and $2$ respectively: The minimum number of key insertions that causes a new level to be introduced in the above $B^+$ tree ________. (Assume key redistribution is not allowed)
6
Which of the following statements true for $B$ tree and $B^+$ tree index? A. $B$ tree index faster for range queries compare to $B^+$ tree index. B. If disk block allocated for $B^+$ tree index and same size disk block allocated for $B$ tree index then number of index ... cost of $B^+$ tree index less than equal to I/O cost of $B$ tree index for random access of same key from set of distinct keys.
7
a) 1631 b)1635 c)716 d)713
8
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
9
can anyone please explain the standard/universal procedure on how to perform deletion in b+ tree with the help of an example.
10
can anyone please explain the standard/universal procedure on how to perform insertion in b+ tree with the help of an example.
11
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?
12
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum keys per node], to make it to reach 3-levels are __________.
1 vote
13
$\text{Insertion Sequence}$ : $8,5,1,7,3,12,9,6$ Can someone plz show the Sequence of insertion in B+ tree step by step Thanks
14
pls explain
1 vote
15
Given a data file with 100 records per page and 1000 pages and on index page capacity of 512 index entries, how deep should be the B+ tree to index this file. please explain with a diagram.
1 vote
16
Question: the below figure shows a B+ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value 34 is inserted into the B+-tree. Obtain the modified B-tree after insertion. My Solution Please validate the solution,
17
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search key size $22$ bytes and both block pointer and record pointer of size $12$ bytes each.Find out a)minimum index block required b)maximum index block required my answers a)$143$ b)$325$.
18
19
20
1 vote
21
22
answer on virtual gate ia given 2, while my answer is 1.
23
Assume a B-plus tree as: Size of search key=15B Size of block=512B Size of record pointer=9B Size of block pointer=8B What is the maximum number of nodes that can be accomodated in each leaf and non-leaf node of the tree?