Register

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

• retagged by
603 views
0 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

1 Answer

Best answer
0 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
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
1.1k
1.1k views
Bikram asked Nov 26, 2016
1,093 views
Test by Bikram | Databases | Test 1 | Question: 24
Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______
0 0 votes
1 answers 1 answer
743
743 views
Bikram asked Nov 26, 2016
743 views
Test by Bikram | Databases | Test 1 | Question: 20
What is the Minimum space utilization for a $B+$ Tree index node:$80 \%$$60 \%$$50 \%$$75 \%$
5 5 votes
1 answers 1 answer
5.5k
5.5k views
Na462 asked May 26, 2018
5,504 views
B+ tree indexing
Which of the following statements true for $B$ tree and $B^+$ tree index?A. $B$ tree index faster for range queries compare to $B^+$ tree index.B. If disk block allocated...
1 1 vote
1 answers 1 answer
710
710 views
Bikram asked Nov 26, 2016
710 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 __________....