# Recent questions tagged b-tree 1 vote
5 answers
1
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
2 votes
1 answer
2
The $2-3-4$ tree is a self-balancing data structure, which is also called : $2-4$ tree $B+$ tree $B-$ tree None of the options
0 votes
1 answer
3
Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B$-trees require less memory than binary search trees Data transfer from disks is in blocks
0 votes
3 answers
4
If following sequence of keys are inserted in a $B+$ tree with $K(=3)$ pointers: $8,5,1,7,3,12,9,6$ Which of the following shall be correct $B+$ tree?
17 votes
2 answers
5
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ and the size of tree/disk pointer is $\text{8 bytes}$. ... memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______
4 votes
3 answers
6
In a B- Tree, each node represents a disk block. Suppose one block holds 8192 bytes, each key uses 32 bytes. In a B-Tree of order M there are M-1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is (1) 32M – 32 (2) 36 M – 32 (3) 36 M – 36 (4) 32M -36
0 votes
0 answers
7
The distinction between B tree and B+ tree is that В tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.
1 vote
1 answer
8
In case of B Trees we split a node on insertion in case of overflow, is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere? just a thought
1 vote
0 answers
9
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight
13 votes
3 answers
10
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? B+ Tree is a height-balanced tree Non-leaf nodes have pointers to data records Key values in each node are kept in sorted order Each leaf node has a pointer to the next leaf node
0 votes
3 answers
11
0 votes
0 answers
12
Identify the B-Tree from the following after inserting R,Y,F,X,A,M,C,D,E,T,H,V,L,G (in the order) with Branching factor of 3. If any insertion of element causes split, first split that node without element insertion and after balanced then insert that element.
0 votes
0 answers
13
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
1 vote
0 answers
14
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?
0 votes
0 answers
15
According to me, since the B trees have a data pointer for each of the key values in their internal nodes, the I/O access for them should take less time since we do not need to traverse down all of the tree.
1 vote
1 answer
16
Which of the following statements is incorrect with respect to B-tree and B+ trees? Deletion operation is easier in B-tree but complex in case of B+ trees. In B+ trees, data records are stored only in the leaf nodes but in B trees data records are stored both in leaf ... Search keys are repeated in case of B+ trees but not in case of B trees. Searching is faster in B+ trees compared to B trees
0 votes
0 answers
17
By default take ROOT at level 1 or 0? and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?
0 votes
1 answer
18
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given
0 votes
2 answers
19
Why B-tree & B+ tree is used in database indexing instead of other tree like BST, Binary tree etc??
0 votes
0 answers
20
The Following key values are inserted into B+ tree in which order of internal node is 4, and that of leaf node is 3, in the sequence given below.The Order of internal node is the maximum number of tree pointers in each node and the order of leaf node is the maximum ... empty 50,15,30,40,35,20,8,10,5 are inserted.The Maximum number of times nodes get spilt up as a result of these insertion ___
1 vote
2 answers
21
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
0 votes
0 answers
22
https://gateoverflow.in/3723/gate2004-it-79 In the above question why record pointer is considered in internal node size calculation?
0 votes
0 answers
23
Why internal node split isn't counted in this question? Only leaf node split is counted. https://gateoverflow.in/1330/gate2009-44
0 votes
1 answer
24
0 votes
2 answers
25
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any non-root node?
0 votes
1 answer
26
0 votes
1 answer
27
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is the maximum number of pointers ... can carry 5 pointer then till 5 element we can insert in one leaf. So answer should be 5+ 19+23 = 47. AM i Right?