Discovering Bucket Orders from Full Rankings

Summary: Introduces Bucket Gap and Abnormal Rank Gap to discover bucket orders from noisy full rankings, reframing from a representative to an approximation perspective. Leverages inter-bucket dissimilarity and cross-quantile closeness; outperforms Bucket Pivot with ~30% lower error and ~50% noise tolerance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3977
Venue: SIGMOD
Year: 2008
Pagerank: 4.1945683e-05
Overall Rank: 12,359 | 14.03%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
709	Efficient Similarity Search and Classification via Rank Aggregation	2003	SIGMOD	0.00017768547

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,834	A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems	2020	VLDB	4.9117328e-05
7,632	Rank Aggregation with Proportionate Fairness	2022	SIGMOD	4.6915165e-05
5,555	On Obtaining Stable Rankings	2019	VLDB	5.4386174e-05
5,700	Rank aggregation with ties: Experiments and Analysis	2015	VLDB	5.365274e-05
4,918	Top-k Sorting Under Partial Order Information	2018	SIGMOD	5.8282325e-05
8,061	Efficient Computation of Quantiles over Joins	2023	PODS	4.5943269e-05
7,009	Understanding local structure in ranked datasets	2013	CIDR	4.8637193e-05
12,088	Rank Discovery From Web Databases	2013	VLDB	4.1945683e-05
7,513	Ranking Large Temporal Data	2012	VLDB	4.7180617e-05
2,385	Comparing and Aggregating Rankings with Ties	2004	PODS	8.9247846e-05