1 votes 1 votes Databases databases indexing + – nikkey123 asked Jan 11, 2018 nikkey123 295 views answer comment Share Follow See 1 comment See all 1 1 comment reply Ashwin Kulkarni commented Jan 11, 2018 reply Follow Share Is answer $180\ msec?$ file size = $2^{29} B$ Block size = $128B = 2^7 B$ Record size = $8B = 2^3B$ Now each block contains = $\frac{2^7}{2^3} = 2^4$ records. Hence Blocks required = $\frac{2^{29}}{2^4} = 2^{25}$ Now 1 index from each block. and which is of size $1B$ Hence each block will contain $2^7$ records. Hence for searching, we can build $\frac{2^{25}}{2^7}$ = $2^{18}$ blocked primary index. Hence to search a block we required $log_2\ 2^{18}$ accesses. Hence 18 accesses. And hence time = $18*10$ = $180\ msec$ And to get the required block we need $log_2n + 1$ accesses but that is not asked here. 1 votes 1 votes Please log in or register to add a comment.