Unformatted text preview: Θ(  V  +  E  ) . 14.18 As with MovetoFront, the contribution of unsuccessful searches requiring comparisons between keys A and B is independent of other keys. We have an unsuccessful search for A if and only if we have had more requests for B so far. Assuming that B is requested R B times and A is requested R A times with R B > R A , we can only have unsuccessful searches twice the number of times that A is requested. This happens at most for R A requests to B occurring before R A requests to A. The remaining requests to B are successful without encountering A. Thus, the Count heuristic can have cost at most twice that of the optimal static ordering....
View
Full Document
 Fall '08
 BELL,D
 Force, Summation, 25%

Click to edit the document details