adplus-dvertising
frame-decoration

Question

A B+ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given this scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ tree ?

a.

16

b.

42

c.

43

d.

44

Answer: (a).16

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A B+ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names are of length 8 bytes, disk block are of size 512 bytes and index...
keshav : June 26, 2023

this answer is wrong
(n-1)key+n*BlockPointer=<512
8n-8+4n=<512
12n=<520
n=43.3..
using this formula you get 43

please do not mention wrong answers many of students loosing their confidence due to these silly errors. please provide right answers

Similar Questions

Discover Related MCQs

Q. What is Granularity ?

Q. Which level of Abstraction describes what data are stored in the Database ?

Q. The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is …………….

Q. Consider a schema R(A, B, C, D) and functional dependencies A->B and C->D. Then the decomposition R1(A, B) and R2(C, D) is

Q. A hash table has space for 75 records, then the probability of collision before the table is 6% full.

Q. Which command classes text file, which has been created using “SET ALTERNATIVE” < FILE NAME > “Command” ?

Q. Which of the following statements is true, when structure of database file with 20 records is modified?

Q. The SQL Expression

Select distinct T. branch name from branch T, branch S where T. assets > S. assets and S. branch-city = DELHI,

finds the name of

Q. Which of the following is the recovery management technique in DDBMS ?

Q. Which of the following is the process by which a user’s privileges ascertained ?

Q. The basic variants of time-stampbased method of concurrency control are

Q. A transaction can include following basic database access operations :

Q. Consider a hash table of size m = 10000 and the hash function h(k) = ∟m(kA mod 1)'┘ for A = (√5–1)/2. The location to the key k = 123456 is

Q. The dependency preservation decomposition is a property to decompose database schema D, in which each functional dependency X->Y specified in F,

Q. Which of the following is an optimistic concurrency control method?

Q. Which of the following is the process by which a user’s access to physical data in the application is limited, based on his privileges?

Q. Linear probing suffers from a problem known as

Q. An entity instance is a single occurrence of an …………..

Q. Generalization is ………… process.

Q. Match the following:

Set-I
I. 2 NF
II. 3 NF
III. 4 NF
IV. 5 NF

Set-II
(a) transitive dependencies eliminated
(b) multivalued attribute removed
(c) contain no partial functional dependencies
(d) contains no join dependency

Codes :
    I    II   III   IV