Fagin's algorithm (FA) Access each of the sorted lists in a sequential manner   This is sequential I/O Continue the sorted accesses till at least objects have been "seen fully", i.e., all the scores for these objects have been retrieved For all objects seen so far, perform random accesses to complete retrieval of their scores Compute the aggregates for all objects thus retrieved Output the top- list