Which of the following is true for B+ trees: – McqOptions

MCQOPTIONS

1.	Which of the following is true for B+ trees:
A.	B+ trees are for storing data on disk.
B.	On B+ trees range queries are faster.
C.	B+ trees are for secondary indexes.
D.	B+ trees are for primary indexes.
Answer» C. B+ trees are for secondary indexes.

Discussion

No Comment Found

Related MCQs

Which of the following is correct form of type-casting in C++?
Which of the following is not a function of aggregate function?
Which of the following is true for B+ trees:
Predict the output of following C++ program. #include  using namespace std; class abc { static int x; public: abc() { x++; } static int getX() {return x;} }; int Test::x = 0; int main() { cout << abc::getX() << " "; abc t[5]; cout << abc::getX(); }
7489 IC is a:
Which of the following in the data structure in which insertion can place from any direction but deletion can only takes place from opposite direction: