Register

Recent questions tagged b-tree

1 1 vote
1 1 answer
1.2k
1.2k views
B+ tree
Assume a system has following parameters to construct a B+ tree. The specification of the tree are:• Size of search key is 15 B• Size of block is 512 B• Size of record po...
User Avatar
2 2 votes
2 2 answers
2.7k
2.7k views
B Trees
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.B tree index has more levels than B+ tree ...
User Avatar
0 0 votes
0 0 answers
1.2k
1.2k views
nptel
Consider a B-tree with the following specifications: Page size c = 2 kB; Size of key γ = 32 bytes; Size of pointer η = 8 bytes. What is the order m of the B+-tree? How ma...
User Avatar
0 0 votes
0 0 answers
505
505 views
self doubt dbms
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 0 votes
1 1 answer
1.2k
1.2k views
data base 2
User Avatar
0 0 votes
1 1 answer
547
547 views
data base 1
User Avatar
0 0 votes
1 1 answer
838
838 views
B-tree
please check this
User Avatar
0 0 votes
1 answers 1 answer
803
803 views
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.
User Avatar
0 0 votes
1 answers 1 answer
999
999 views
B tree
A B tree has order 10. Suppose it's leaf node already has 9 elements and one more element is inserted in it and split occurs. Now my question is is it always necessary th...
User Avatar
3 3 votes
2 2 answers
7.9k
7.9k views
B+ tree maximum number of records.
What is the maximum number of records that can be indexed in B+ tree of level $4$ ,order $10$ where root is at level $1$ ?As the order of tree is $10$, nodes in the last ...
User Avatar
1 1 vote
1 1 answer
3.0k
3.0k views
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) ?
User Avatar
0 0 votes
1 1 answer
993
993 views
UGC NET CSE | June 2009 | Part 2 | Question: 24
In a B tree of order m with p nodes the average number of splits is at most :1/(⌈m/2⌉−1) ⌈m/2⌉−1 1/(m/2) None
User Avatar
1 1 vote
1 answers 1 answer
872
872 views
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 max...
User Avatar
1 1 vote
1 answers 1 answer
777
777 views
Test by Bikram | Databases | Test 2 | Question: 9
In a B-Tree, the block size is $512$ Bytes, search key is $4$ Bytes, block pointer size is $8$ Bytes and record pointer size is $8$ Bytes. Every node contains $n-1$ recor...
User Avatar
1 1 vote
2 2 answers
3.6k
3.6k views
Ace Test Series: Databases - B Tree
When would you want to use a B-tree instead of B+ Tree?1. When sequential access to key values is never required.2. When sequential access to key values is required.3. Wh...
User Avatar
2 2 votes
1 1 answer
1.2k
1.2k views
databases
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 2 votes
2 2 answers
697
697 views
databases
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
User Avatar
0 0 votes
1 1 answer
2.5k
2.5k views
block size of B tree and B+ tree( doubt)
Will block size of B tree and B+ tree same for same key size and pointer sizeOne more doubt For B+ tree at leaf(Key and Record Pointer) and at non leaf node(Block pointer...
User Avatar
1 1 vote
2 2 answers
1.8k
1.8k views
Databases- B and B+ Tree
Searching and retrieval of data is more efficient using which tree?B Tree or B+ Tree?
User Avatar
53 53 votes
7 answers 7 answers
21.0k
21.0k views
GATE CSE 2017 | Set 2 | Question: 49
In a $B^+$ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the $B^+$ Tr...
User Avatar
2 2 votes
1 1 answer
1.7k
1.7k views
GateBook Mock Test_2(B-tree)
A B-tree of order m is a tree which satisfies the following properties:Every node has at most m children.Every node (except root) has at least ⌈m/2⌉ children maximium n...
User Avatar
1 1 vote
0 0 answers
668
668 views
B and B + trees qn. doubt
Que1Que 2B and B+ trees always confused me in mock tests... here i m posting 2 of the ques from that topic... can someone just demonstrat the resultant tree after executi...
User Avatar
1 1 vote
1 1 answer
835
835 views
MadeEasy Subject Test: Databases - B Tree
User Avatar
0 0 votes
0 0 answers
852
852 views
B+ tree
Consider the B+ tree shown in FigureWhat is the minimum number of insertions of data entries with distinct keys that will cause the height of the original tree to change ...
User Avatar
0 0 votes
0 0 answers
963
963 views
MadeEasy Subject Test: Databases - B Tree
Which of the following is true ?B Tree index nodes less than or equal B+ Tree index nodes for n keys.B+ Tree index nodes less than or equal B Tree index nodes for n keys....
User Avatar
0 0 votes
0 0 answers
813
813 views
B tree deletion doubt
What will be the resultant B tree after deleting A,V and then P? Order of B tree is 3
User Avatar
1 1 vote
3 answers 3 answers
11.4k
11.4k views
UGC NET CSE | January 2017 | Part 3 | Question: 12
If following sequence of keys are inserted in a B+ tree with K(=3) pointers:8, 5, 1, 7, 3, 12, 9, 6Which of the following shall be correct B+ tree?
User Avatar
0 0 votes
0 0 answers
1.1k
1.1k views
MadeEasy Subject Test: Databases - B Tree
User Avatar
0 0 votes
1 1 answer
835
835 views
MadeEasy Subject Test: Databases - B Tree
What is the meaning of d option.
User Avatar
3 3 votes
1 answers 1 answer
1.2k
1.2k views
Test by Bikram | Mock GATE | Test 2 | Question: 13
Which of these statements is not true about a b-Tree $T$ with height $h$ and $n$ nodes, assuming that each node takes exactly $1$ $disk$ operation to read? Finding a node...
User Avatar
Page: