: 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...
%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 grade middleware optimal rank threshold
%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 = {2010-02-18T14:20:38.000+0100},
author = {Fagin, Ronald and Lotem, Amnon and Naor, Moni},
biburl = {https://www.bibsonomy.org/bibtex/25fae1d60624767e4b3dea4d1a985cf7c/sdo},
booktitle = {Symposium on Principles of Database Systems},
citeulike-article-id = {2801543},
interhash = {8bbc6d283a09e8ec8c082496b2f25865},
intrahash = {5fae1d60624767e4b3dea4d1a985cf7c},
keywords = {aggregation algorithm grade middleware optimal rank threshold},
posted-at = {2008-05-15 13:57:01},
priority = {0},
timestamp = {2010-02-18T14:20:38.000+0100},
title = {Optimal Aggregation Algorithms for Middleware},
url = {http://citeseer.ist.psu.edu/441654.html},
year = 2001
}