Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
The total cost of retrieving records in sorted order using an unclustered B+ tree is
(P – Average number of records per data page
N – Data pages
F – Ratio of the size of a data entry to the size of a data record)
Solution
In an unclustered B+ tree, retrieving records in sorted order requires scanning index entries and then fetching records from data pages.
Cost of scanning leaf level entries:
$F \times N$
Number of records:
$P \times N$
So, total cost:
$FN + PN = (F + P)N$
Final Answer: (b) (F + P) * N
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
