Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index
(a) 13n /30
(b) n/3
(c) n/10
(d) n/30
number of blocks to store the n pointers (as it's dense index, there exist a pointer(index record) for every search key ) is : n/10
number of blocks needed to store the n records : n/3
so answer is n/10 + n/3 = 13n/10
Refer below link to get more idea about the dense and sparse indexing.
https://stackoverflow.com/questions/36808877/difference-between-sparse-index-and-dense-index
(a) 13n /30
(b) n/3
(c) n/10
(d) n/30
number of blocks to store the n pointers (as it's dense index, there exist a pointer(index record) for every search key ) is : n/10
number of blocks needed to store the n records : n/3
so answer is n/10 + n/3 = 13n/10
Refer below link to get more idea about the dense and sparse indexing.
https://stackoverflow.com/questions/36808877/difference-between-sparse-index-and-dense-index
No comments:
Post a Comment