Database Paper Browser

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
1703
Venue
PODS
Year
2016
Pagerank
4.3938681e-05
Overall Rank
9,113 | 36.61%
DOI
10.1145/2902251.2902308

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,123 External Merge Sort for Top-K Queries: Eager input filtering guided by histograms 2020 SIGMOD 4.3920263e-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