## Given a collection of databases, {db1, db2, … , dbN}, a random ranking algorithm is one in which each of the N! permutations is equally likely.

## There are situations in which this algorithm is as good as any other.

## Gives lower bound on performance.

Previous slide | Next slide | Back to first slide | View graphic version |