[prev] 40 [next]

Exercise 2: Operation Costs

For each of the following file structures
  • heap file, sorted file, hash file
Determine #page-reads + #page-writes for insert and delete

You can assume the existence of a file header containing

  • values for r, R, b, B, c
  • index of first page with free space (and a free list)
Assume also
  • each page contains a header and directory as well as tuples
  • no buffering   (worst case scenario)