Register

Recent questions tagged b-tree

2 votes
1 answer
33
Applied Mock Test
The smallest number of keys that will force a B-Tree of order 3 to have a height of 3 are _______ Consider that the root node is at height 0.
The smallest number of keys that will force a B-Tree of order 3 to have a height of 3 are _______Consider that the root node is at height 0.
User Avatar
1 votes
1 answer
34
Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
User Avatar
5 votes
5 answers
35
GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
User Avatar
1 votes
1 answer
36
GATE Overflow Test Series | Mock GATE | Test 4 | Question: 60
Consider a $B$-tree in which the search key is $16$ bytes long, block size is $4096$ bytes, data pointer is $4$ bytes and block pointer is $8$ bytes. The maximum order of $B$-tree will be ________
Consider a $B$-tree in which the search key is $16$ bytes long, block size is $4096$ bytes, data pointer is $4$ bytes and block pointer is $8$ bytes. The maximum order of...
User Avatar
2 votes
1 answer
38
GATE Overflow Test Series | Databases | Test 1 | Question: 29
Consider a $B$-tree in which the search key is $20$ bytes long, block size is $1024$ bytes, data pointer is $10$ bytes and block pointer is $8$ Bytes. The maximum order of $B$-tree will be ________
Consider a $B$-tree in which the search key is $20$ bytes long, block size is $1024$ bytes, data pointer is $10$ bytes and block pointer is $8$ Bytes. The maximum order o...
User Avatar
2 votes
1 answer
39
NIELIT 2017 DEC Scientific Assistant A - Section B: 21
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
The $2-3-4$ tree is a self-balancing data structure, which is also called :$2-4$ tree$B+$ tree$B-$ treeNone of the options
User Avatar
1 votes
1 answer
43
B TRees DBMS Self doubt
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
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 th...
User Avatar
0 votes
3 answers
46
B+ Tree Records
User Avatar
0 votes
0 answers
48
self doubt
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.
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, fir...
User Avatar
0 votes
0 answers
49
B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
User Avatar
1 votes
0 answers
50
self doubt
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?
For range queries every B+ tree index requires less I/O than a full table scan.can anyone explain?
User Avatar
0 votes
1 answer
52
MadeEasy Subject Test 2019: Databases - B Tree
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?
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?
User Avatar
0 votes
1 answer
53
B+ tree doubt
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
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-TreePlease also re...
User Avatar
Page: