DBScholar

Back to papers

On Pruning for Top-K Ranking in Uncertain Databases

Summary: Pruning for top-k ranking in uncertain databases under possible-world semantics. Mathematical manipulation of possible worlds exposes prunable work and yields systematic pruning rules; applies to many PRF-based rankings, with thorough experimental evaluation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10479
Venue
VLDB
Year
2011
Pagerank
5.093636e-05
Overall Rank
12,403 | 14.91%
DOI
10.14778/2001269.2001270

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{wang_vldb11,
        title = {{On Pruning for Top-K Ranking in Uncertain Databases}},
        author = {Wang, Chonghai and Yuan, Li Yan and You, Jia-Huai and Zaiane, Osmar R. and Pei, Jian},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {4},
        number = {10},
        pages = {598--609},
        doi = {10.14778/2001269.2001270},
        url = {https://doi.org/10.14778/2001269.2001270},
        year = {2011}
}

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 6 of 6 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