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 (University of Maryland)
- 2. Amol Deshpande (University of Maryland)
BibTeX Citation
@inproceedings{li_pods09,
address = {New York, NY, USA},
series = {{PODS} '09},
title = {{Consensus Answers for Queries over Probabilistic Databases}},
url = {https://dl.acm.org/doi/10.1145/1559795.1559835},
doi = {10.1145/1559795.1559835},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Li, Jian and Deshpande, Amol},
year = {2009}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,365 | A Unified Approach to Ranking in Probabilistic Databases | 2009 | VLDB | 0.00010913898 |
| 2,620 | Ranking with Uncertain Scoring Functions: Semantics and Sensitivity Measures | 2011 | SIGMOD | 8.2168186e-05 |
| 3,893 | Ranking Continuous Probabilistic Datasets | 2010 | VLDB | 6.940442e-05 |
| 6,108 | Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data | 2011 | VLDB | 5.8850424e-05 |
| 8,639 | Efficient Summarization Framework for Multi-Attribute Uncertain Data | 2014 | SIGMOD | 5.2978746e-05 |
| 9,380 | JENNER: Just-in-time Enrichment in Query Processing | 2022 | VLDB | 5.1868213e-05 |
| 11,100 | A Rank-Based Approach to Recommender System’s Top-K Queries with Uncertain Scores | 2025 | SIGMOD | 4.9793485e-05 |
| 12,694 | On Pruning for Top-K Ranking in Uncertain Databases | 2011 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 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 |
|---|---|---|---|---|
| 1 | 5,340 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB |
| 2 | 6,808 | Benchmarking Approximate Consistent Query Answering | 2021 | PODS |
| 3 | 1,365 | A Unified Approach to Ranking in Probabilistic Databases | 2009 | VLDB |
| 4 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 5 | 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 6 | 4,389 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 7 | 51 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 8 | 7,466 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 9 | 7,858 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 10 | 5,779 | Consistent Query Answers in Inconsistent Probabilistic Databases | 2010 | SIGMOD |