Example has the highest aggregate score, even though it is not the highest in any of the lists completely dominates , and hence, may be pruned Brute-force algorithm (BF) looks at all objects and scores   Running time: Lists may not t into memory   Number of disk page accesses may be excessive   Running time impractical