Title: top-K algorithm (TA) and its variations 
<br>
<br>
PRESENTER: Jian Xu<br>
TIME: Thu Oct 23, 2pm<br>
LOCATION: room 304<br>
<br>
<br>
ABSTRACT:<br>
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.
<br>
<br>
Reference:

<ul>
<li><a href="http://www.acm.org/sigs/sigmod/pods/proc01/online/p28.pdf">
R. Fagin, A. Lotem, and M. Naor, Optimal Aggregation Algorithms for Middleware, PODS'01</a>
<li><a href="http://www.vldb2005.org/program/paper/thu/p637-michel.pdf">
S. Michel, P. Triantafillow, and G. Weikum, KLEE: A Framework for Distributed Top-k Query Algorithms, VLDB'05</a>  
<li><a href="http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r02p01.pdf">
B. Babcock, C. Olston, Distributed Top-K Monitoring, SIGMOD'03</a> 
</ul>