Optimal Aggregation Algorithms for Middleware Export

@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...}, author = {Fagin, Ronald and Lotem, Amnon and Naor, Moni}, booktitle = {Symposium on Principles of Database Systems}, citeulike-article-id = {2801543}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.5868}, keywords = {aggregation, algorithm, fagin, rank, threshold, topk}, posted-at = {2008-05-15 13:57:01}, priority = {0}, title = {Optimal Aggregation Algorithms for Middleware}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.5868}, year = {2001} }

TY - CONF ID - citeulike:2801543 L3 - citeulike-article-id:2801543 N2 - : 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... TI - Optimal Aggregation Algorithms for Middleware T2 - Symposium on Principles of Database Systems KW - aggregation KW - algorithm KW - fagin KW - rank KW - threshold KW - topk AU - Fagin, Ronald AU - Lotem, Amnon AU - Naor, Moni PY - 2001/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.5868 ER -