A B-Tree used as an index for a large database table has four levels i – McqOptions

MCQOPTIONS

1.	A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are
A.	5
B.	4
C.	1
D.	2
Answer» B. 4

Discussion

No Comment Found

Related MCQs

State true or false: It is easier to delete a record from the fixed length records
The header in the slotted page structure does not contain which of the following data?
The slotted page structure is used for _________
An attribute(s) that is used to look up for records in a file is called a:
If a node has K children in B tree, then the node contains exactly _______ keys.
Consider a table that describes the customers:Customers(custid, name, gender, rating)The rating value is an integer in the range 1 to 5 and only two values (male and female) are recorded for gender. Consider the query “how many male customers have a rating of 5”? The best indexing mechanism appropriate for the query is
In which of the following hash functions, do consecutive keys map to consecutive hash values?
In a file which contains 1 million records and the order of the tree is 100, then what is the maximum number of nodes to be accessed if B + tree index is used?
In linear hashing, if blocking factor bfr, loading factor I and file buckets N are known, the number of records will be
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are