b-plus-tree

An index in a DBMS is said to be dense if an index entry appears for every searchkey value in the indexed file. Otherwise it is called a sparse index. Consider the following two st...

In a $\mathrm{B}^{+}$- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes: $$A=(49,77,83,-), B=(7,19,33,44), C=\left(20^*, 2...

In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?

Which one of the following statements is NOT correct about the B + tree data structure used for creating an index of a relational database table?

B + Trees are considered BALANCED because

Consider a B + tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of key...

Consider a B + - tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?

The order of a leaf node in a B + - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 by...

A B + - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk blocks are of size 512 bytes, and index p...

B + -trees are preferred to binary trees in databases because

Which of the following is correct?