search
Log In
0 votes
87 views
If there is a B-Tree of order 4 and when splitting is there, then there will be 2 elements in the middle, then which element to take upward ?
in Databases 87 views

1 Answer

0 votes

See it..

Related questions

4 votes
3 answers
1
577 views
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
asked Dec 21, 2019 in Databases Sanjay Sharma 577 views
0 votes
2 answers
2
757 views
Which of the following is not correct about B + Tree, which is used for creating index of relational database table? (a) Key values in each node kept in sorted order (b) Leaf node pointer points to next node (c) B + tree is height balanced tree (d) Non-leaf node have pointers to data records
asked Feb 4, 2019 in Databases HeartBleed 757 views
0 votes
3 answers
3
349 views asked Feb 2, 2019 in Databases Na462 349 views
0 votes
0 answers
4
113 views
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
asked Jan 9, 2019 in Databases bts1jimin 113 views
...