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: 1497
Venue: PODS
Year: 2009
Pagerank: 7.372823e-05
Overall Rank: 3,483 | 76.11%
DOI: 10.1145/1559795.1559835

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,327	A Unified Approach to Ranking in Probabilistic Databases	2009	VLDB	0.00011141552
2,571	Ranking with Uncertain Scoring Functions: Semantics and Sensitivity Measures	2011	SIGMOD	8.4029939e-05
3,823	Ranking Continuous Probabilistic Datasets	2010	VLDB	7.092508e-05
6,561	Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data	2011	VLDB	5.8389373e-05
8,584	Efficient Summarization Framework for Multi-Attribute Uncertain Data	2014	SIGMOD	5.4079618e-05
9,200	JENNER: Just-in-time Enrichment in Query Processing	2022	VLDB	5.3058708e-05
10,657	A Rank-Based Approach to Recommender System’s Top-K Queries with Uncertain Scores	2025	SIGMOD	5.093636e-05
12,403	On Pruning for Top-K Ranking in Uncertain Databases	2011	VLDB	5.093636e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
17	Provenance Semirings	2007	PODS	0.00059843817
50	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB	0.00043596705
125	Trio: A System for Integrated Management of Data, Accuracy, and Lineage	2005	CIDR	0.00030932014
337	Model-Driven Data Acquisition in Sensor Networks	2004	VLDB	0.00020783399
359	Evaluating Probabilistic Queries over Imprecise Data	2003	SIGMOD	0.0002023153
574	Management of Probabilistic Data: Foundations and Challenges	2007	PODS	0.00016278855
680	Creating Probabilistic Databases from Information Extraction Models	2006	VLDB	0.0001504854
820	BayesStore: Managing Large, Uncertain Data Repositories with Probabilistic Graphical Models	2008	VLDB	0.00013814535
1,327	A Unified Approach to Ranking in Probabilistic Databases	2009	VLDB	0.00011141552
1,363	Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach	2008	SIGMOD	0.00011025316
1,605	Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases	2008	VLDB	0.00010229844
2,253	Approximation Algorithms for Clustering Uncertain Data	2008	PODS	8.8664016e-05
2,460	Exploiting Shared Correlations in Probabilistic Databases	2008	VLDB	8.5505905e-05
2,514	From Complete to Incomplete Information and Back	2007	SIGMOD	8.4818577e-05
2,904	Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases	1989	PODS	7.9757931e-05
2,936	Materialized Views in Probabilistic Databases: For Information Exchange and Query Optimization	2007	VLDB	7.9437689e-05
2,988	Estimating Statistical Aggregates on Probabilistic Data Streams	2007	PODS	7.8907087e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	13,483	Supporting Hard Queries over Probabilistic Preferences	2020	VLDB
2	6,674	Benchmarking Approximate Consistent Query Answering	2021	PODS
3	9,009	Efficient Approximations of Conjunctive Queries	2012	PODS
4	1,327	A Unified Approach to Ranking in Probabilistic Databases	2009	VLDB
5	1,707	The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints	2015	PODS
6	4,301	Read-Once Functions and Query Evaluation in Probabilistic Databases	2010	VLDB
7	50	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB
8	7,317	Probabilistic Query Evaluation: The Combined FPRAS Landscape	2023	PODS
9	7,706	Conjunctive Queries on Probabilistic Graphs: Combined Complexity	2017	PODS
10	5,648	Consistent Query Answers in Inconsistent Probabilistic Databases	2010	SIGMOD