DBScholar

Back to papers

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
4039
Venue
SIGMOD
Year
2008
Pagerank
5.093636e-05
Overall Rank
12,552 | 13.89%
DOI
10.1145/1376616.1376625

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{feng_sigmod08,
        title = {{Discovering Bucket Orders from Full Rankings}},
        author = {Feng, Jianlin and Fang, Qiong and Ng, Wilfred},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376625},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376625},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

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

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
690 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.0001492934
Previous Page 1 / 1 Next

Semantically Similar Papers