Analysis |
|
- Any object not seen cannot be in top- list
|
- Dominated by threshold score
|
|
|
- For any algorithm that does not make random guesses and any sorted list, cost of TA has the same order as the best algorithm
|
|
- Best for any instance (any database, any , etc.)
|
- FA is optimal with a high probability
|
|
|
|
- Cost of TA is
|
- Good when m is small; suffers many random accesses when is large
|