edited by
240 views
0 votes
0 votes

Which one is NOT True among these statements:

  1. In B+-tree, data pointers are stored only at the leaf nodes of the tree
  2. Any B-tree is a search tree may not be always balanced
  3. In a B-tree, every value of the search field appears once at some level in the tree
  4. The leaf nodes of the B+-tree are linked together to provide ordered access on the search field to the records
edited by

1 Answer

Best answer
0 votes
0 votes
Any  B-tree is a search tree may not be always balanced --- is FALSE.

 

B-tree is a search tree which is always balanced
selected by
Answer:

Related questions

1 votes
1 votes
1 answer
1
Bikram asked Nov 26, 2016
319 views
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 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
229 views
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
295 views
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 ⋈ θ...