Title: top-K algorithm (TA) and its variations
PRESENTER: Jian Xu
TIME: Thu Oct 23, 2pm
LOCATION: room 304
In this talk, I am looking at some papers around top-k computation. The [FaginLN01] paper presents the famous TA algorithm which is a special case of the more generalized FA algorithm family. The [BabcockO03] paper is about continuously monitoring top-K aggregates. The slides actually discusses a variation of TA to use a similar idea on computing top-k over distributed peers, which as small number of communications as possible.