Register

Test by Bikram | Databases | Test 1 | Question: 20

• retagged by
744 views

1 Answer

Best answer
1 1 vote
Every internal node in B+ tree(except the root) must have atleast ceil(p/2) child pointers and ceil(p/2)-1 keys, where p is the order of the B+tree. So minimum space utilization is 50%.
• selected by
Voting & Accepting an answer helps improve the community
Answer:
← Previous · Test by Bikram | Dat...Next → · Test by Bikram | Dat...
← Previous in category · Test by Bikram | Dat...Next in category → · Test by Bikram | Dat...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
605
605 views
Bikram asked Nov 26, 2016
605 views
Test by Bikram | Databases | Test 1 | Question: 12
Which one is NOT True among these statements:In B+-tree, data pointers are stored only at the leaf nodes of the treeAny B-tree is a search tree may not be always balanced...
1 1 vote
1 answers 1 answer
711
711 views
Bikram asked Nov 26, 2016
711 views
Test by Bikram | Databases | Test 1 | Question: 30
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________....
0 0 votes
1 1 answer
562
562 views
Bikram asked Nov 26, 2016
562 views
Test by Bikram | Databases | Test 1 | Question: 29
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y
0 0 votes
1 1 answer
757
757 views
Bikram asked Nov 26, 2016
757 views
Test by Bikram | Databases | Test 1 | Question: 28
What does the following Tuple Relational Calculus query produce?The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ1∨ θ2 E2 None of t...