DBScholar

Back to papers

Ad-Hoc Aggregations of Ranked Lists in the Presence of Hierarchies

Summary: Ranked lists with hierarchies; traditional early-stopping certificates fail. Proposes pH-RA, a probabilistic algorithm with deterministic stopping at user-specified precision, plus sparse-set precomputation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4040
Venue
SIGMOD
Year
2008
Pagerank
5.9508648e-05
Overall Rank
6,175 | 57.64%
DOI
10.1145/1376616.1376626

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bansal_sigmod08,
        title = {{Ad-Hoc Aggregations of Ranked Lists in the Presence of Hierarchies}},
        author = {Bansal, Nilesh and Guha, Sudipto and Koudas, Nick},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376626},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376626},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers