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)
Incoming Non-self Citations Over Time
Authors
- 1. Jian Li
- 2. Amol Deshpande
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,612 | A Unified Approach to Ranking in Probabilistic Databases | 2009 | VLDB | 0.00011142757 |
| 3,015 | Ranking with Uncertain Scoring Functions: Semantics and Sensitivity Measures | 2011 | SIGMOD | 7.7079141e-05 |
| 4,094 | Ranking Continuous Probabilistic Datasets | 2010 | VLDB | 6.4510938e-05 |
| 6,865 | Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data | 2011 | VLDB | 4.9002126e-05 |
| 8,361 | Efficient Summarization Framework for Multi-Attribute Uncertain Data | 2014 | SIGMOD | 4.5314883e-05 |
| 9,049 | JENNER: Just-in-time Enrichment in Query Processing | 2022 | VLDB | 4.3997447e-05 |
| 10,376 | A Rank-Based Approach to Recommender System’s Top-K Queries with Uncertain Scores | 2025 | SIGMOD | 4.1905499e-05 |
| 12,216 | On Pruning for Top-K Ranking in Uncertain Databases | 2011 | VLDB | 4.1905499e-05 |
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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,167 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1725053e-05 |
| 6,740 | Benchmarking Approximate Consistent Query Answering | 2021 | PODS | 4.9401646e-05 |
| 1,612 | A Unified Approach to Ranking in Probabilistic Databases | 2009 | VLDB | 0.00011142757 |
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 2,246 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2039096e-05 |
| 4,722 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.9646931e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057797415 |
| 7,162 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 4.8085863e-05 |
| 7,604 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.6944524e-05 |
| 6,707 | Consistent Query Answers in Inconsistent Probabilistic Databases | 2010 | SIGMOD | 4.9500448e-05 |