The Gateway to Computer Science Excellence
0 votes
35 views

Consider that blocks can hold either ten records or 99 keys and 100 pointers. Assume that the average B+ tree node is oncost 70% full, i.e. except root it will have 69 keys and 70 pointers. The total number of blocks needed for a 10000. record file, if memory initially is empty, the search key is the primary key for the records and the data file is a sequential file, sorted on the search key, with 10 records per block with dense index are ______.

in Databases by (497 points)
edited by | 35 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,832 questions
57,686 answers
199,273 comments
107,214 users