Database Paper Browser

Back to papers

Consensus Answers for Queries over Probabilistic Databases

Summary: Introduce “consensus world” — a deterministic answer minimizing expected distance to possible worlds, extending rank-aggregation to probabilistic databases. Derive polytime optimal/approx algorithms and NP-hardness for SPJ, Top‑k, group-by aggregates, and clustering under the expressive and/xor-tree model. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1498
Venue
PODS
Year
2009
Pagerank
7.0337815e-05
Overall Rank
3,505 | 75.62%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 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