Threshold algorithm (TA) Access each of the sorted lists in a sequential manner As soon as an object is seen in a list, (if necessary) complete its retrieval by performing random accesses to other lists Compute its aggregate score Retain if in current top- list Maintain a threshold score Threshold score is aggregate of m scores last seen by sorted accesses on each of the lists Stop when threshold score falls below th score in top- list Output the top- list