Database Paper Browser

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
3979
Venue
SIGMOD
Year
2008
Pagerank
5.1209778e-05
Overall Rank
6,292 | 56.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

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

Overall Rank Paper Year Venue Pagerank
1,996 Probabilistic Ranking of Database Query Results 2004 VLDB 9.8374939e-05
2,384 Comparing and Aggregating Rankings with Ties 2004 PODS 8.9177815e-05
6,054 Ranking Objects by Exploiting Relationships: Computing Top-K over Aggregation 2006 SIGMOD 5.2310615e-05
7,512 Ranking Large Temporal Data 2012 VLDB 4.7135369e-05
12,119 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.1905499e-05
1,805 Top-k Query Evaluation with Probabilistic Guarantees 2004 VLDB 0.00010479371
12,199 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.1905499e-05
12,096 Rank Discovery From Web Databases 2013 VLDB 4.1905499e-05
1,612 A Unified Approach to Ranking in Probabilistic Databases 2009 VLDB 0.00011142757
7,133 Anytime Measures for Top-k Algorithms 2007 VLDB 4.8175888e-05