DBScholar

Back to papers

Optimal Score Aggregation Algorithms

Summary: Introduces the 10-line Threshold Algorithm for top-k over voters×candidates with monotone score aggregators (e.g., mean/median) in the sorted-access + random-access model, minimizing data accesses. Proves instance-optimality—optimal in every case—earning the Godel Prize. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1702
Venue
PODS
Year
2016
Pagerank
5.2978375e-05
Overall Rank
9,251 | 36.54%
DOI
10.1145/2902251.2902308

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fagin_pods16,
        address = {New York, NY, USA},
        series = {{PODS} '16},
        title = {{Optimal Score Aggregation Algorithms}},
        url = {https://dl.acm.org/doi/10.1145/2902251.2902308},
        doi = {10.1145/2902251.2902308},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fagin, Ronald},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,172 External Merge Sort for Top-K Queries: Eager input filtering guided by histograms 2020 SIGMOD 5.3092396e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers