Register

Recent questions tagged b-tree

0 votes
1 answer
91
MadeEasy Test Series: Databases - B Tree
" B+ tree index has more levels than B tree index for large number of keys. " How the above statement is true ??
" B+ tree index has more levels than B tree index for large number of keys. "How the above statement is true ??
User Avatar
1 votes
1 answer
93
B tree
In B+ tree of order p,each leaf node should have (A) atmost $\left \lceil \frac{p}{2} \right \rceil$ values (B) atleast $\left \lceil \frac{p}{2} \right \rceil$ values (C) atmost $\left \lfloor \frac{p}{2} \right \rfloor$ values (D) atleast $\left \lfloor \frac{p}{2} \right \rfloor$ values
In B+ tree of order p,each leaf node should have(A) atmost $\left \lceil \frac{p}{2} \right \rceil$ values(B) atleast $\left \lceil \frac{p}{2} \right \rceil$ values(C) a...
User Avatar
0 votes
1 answer
94
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
0 votes
0 answers
95
#dbms b+tree
can anyone please explain the standard/universal procedure on how to perform deletion in b+ tree with the help of an example.
can anyone please explain the standard/universal procedure on how to perform deletion in b+ tree with the help of an example.
User Avatar
0 votes
0 answers
96
#dbms b+tree
can anyone please explain the standard/universal procedure on how to perform insertion in b+ tree with the help of an example.
can anyone please explain the standard/universal procedure on how to perform insertion in b+ tree with the help of an example.
User Avatar
0 votes
0 answers
97
madeeasy booklet
while(1) { flag[i]=true; while(flag[j]); <cs> flag[i]=false; } someone please tell bounded wait is satisfying or not???
while(1) {flag[i]=true;while(flag[j]);<cs>flag[i]=false;}someone please tell bounded wait is satisfying or not???
User Avatar
0 votes
1 answer
99
Doubt in gate 2009 B+-tree question
https://gateoverflow.in/1330/gate2009-44 Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing. Do we split every time a node is full? Even when its siblings have space? Thank You.
https://gateoverflow.in/1330/gate2009-44Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing.Do we split eve...
User Avatar
0 votes
0 answers
100
B TREE
User Avatar
0 votes
0 answers
101
B+ trees
Given a B+ tree, How can we find out their sequence of insertion?
Given a B+ tree, How can we find out their sequence of insertion?
User Avatar
1 votes
1 answer
102
B+ tree
$\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
$\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
User Avatar
0 votes
0 answers
103
MadeEasy Test Series: Databases - B Tree
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? given ans is 2499 but I am getting 2450
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?given ans ...
User Avatar
0 votes
0 answers
108
self doubt dbms
Deletion in B+ tree, unable to get the underflow condition when we deal with http://home.iitj.ac.in/~ramana/ch10-st How grouping is done during underflow in B+, IN B we see the most populous sibling and do grouping and merge it.
Deletion in B+ tree, unable to get the underflow condition when we deal with http://home.iitj.ac.in/~ramana/ch10-stHow grouping is done during underflow in B+, IN B we se...
User Avatar
0 votes
1 answer
109
data base 2
User Avatar
0 votes
1 answer
110
data base 1
User Avatar
0 votes
1 answer
111
B-tree
please check this
please check this
User Avatar
0 votes
1 answer
112
virtual gate
Given key values 8,9,5,12,15,16,18,1,2 and using left biasing, which of the following btree is correct with order 3.
Given key values 8,9,5,12,15,16,18,1,2 and using left biasing, which of the following btree is correct with order 3.
User Avatar
1 votes
1 answer
115
B-Tree
What is the maximum number of nodes and keys in a B-tree of order 10 of depth 3 (root at depth 0) ?
What is the maximum number of nodes and keys in a B-tree of order 10 of depth 3 (root at depth 0) ?
User Avatar
1 votes
1 answer
116
Test by Bikram | Databases | Test 2 | Question: 20
Assume that a B-Tree is used as an index for a large database table which has six levels (including the root node). If a new key is inserted into this index, then the maximum number of levels possible in the updated tree is ______.
Assume that a B-Tree is used as an index for a large database table which has six levels (including the root node). If a new key is inserted into this index, then the max...
User Avatar
2 votes
1 answer
119
databases
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4) ANSWER : PLEASE VERIFY ...
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4)ANSWER :PLEASE VERIFY ...
User Avatar
2 votes
2 answers
120
databases
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
User Avatar
Page: