%0 Conference Paper %1 citeulike:2801543 %A Fagin, Ronald %A Lotem, Amnon %A Naor, Moni %B Symposium on Principles of Database Systems %D 2001 %K aggregation, algorithm, fagin, rank, threshold, topk %T Optimal Aggregation Algorithms for Middleware %U http://citeseer.ist.psu.edu/441654.html %X : Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). There is some monotone aggregation function, or combining rule, such as min or average, that combines the individual grades to obtain an...

@inproceedings{citeulike:2801543, abstract = {: Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). There is some monotone aggregation function, or combining rule, such as min or average, that combines the individual grades to obtain an...}, added-at = {2008-06-17T16:01:02.000+0200}, author = {Fagin, Ronald and Lotem, Amnon and Naor, Moni}, biburl = {https://www.bibsonomy.org/bibtex/25fae1d60624767e4b3dea4d1a985cf7c/pprett}, booktitle = {Symposium on Principles of Database Systems}, citeulike-article-id = {2801543}, comment = {(private-note)Introduces Fagin's threshold algorithm. The algorithm enables fast top k retrieval from multiple rankings. A simple algorithm yet very power full - deriving the complexity bounds however is not that simple...}, interhash = {8bbc6d283a09e8ec8c082496b2f25865}, intrahash = {5fae1d60624767e4b3dea4d1a985cf7c}, keywords = {aggregation, algorithm, fagin, rank, threshold, topk}, posted-at = {2008-05-15 13:57:01}, priority = {0}, timestamp = {2008-06-17T16:01:05.000+0200}, title = {Optimal Aggregation Algorithms for Middleware}, url = {http://citeseer.ist.psu.edu/441654.html}, year = 2001 }