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: 3978
Venue: SIGMOD
Year: 2008
Pagerank: 4.1905499e-05
Overall Rank: 12,367 | 14.05%
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
710	Efficient Similarity Search and Classification via Rank Aggregation	2003	SIGMOD	0.00017727016

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,816	A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems	2020	VLDB	4.9115662e-05
7,425	Rank Aggregation with Proportionate Fairness	2022	SIGMOD	4.7292787e-05
5,558	On Obtaining Stable Rankings	2019	VLDB	5.4375292e-05
5,689	Rank aggregation with ties: Experiments and Analysis	2015	VLDB	5.3706419e-05
4,922	Top-k Sorting Under Partial Order Information	2018	SIGMOD	5.8226327e-05
8,065	Efficient Computation of Quantiles over Joins	2023	PODS	4.5899218e-05
7,008	Understanding local structure in ranked datasets	2013	CIDR	4.8603531e-05
12,096	Rank Discovery From Web Databases	2013	VLDB	4.1905499e-05
7,512	Ranking Large Temporal Data	2012	VLDB	4.7135369e-05
2,384	Comparing and Aggregating Rankings with Ties	2004	PODS	8.9177815e-05