Query Evaluation with Soft-Key Constraints
Summary: Introduce soft-key constraints for probabilistic DBs that penalize key violations and model distributions as Markov networks with per-tuple and per-key cardinality potentials. Provide two polynomial-time algorithms for conjunctive-query marginals (single-relation and multi-relation), prove dichotomy to #P-hardness otherwise, and give a syntactic safety criterion: safe iff safe after making each key hard or removed. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Abhay Jha
- 2. Vibhor Rastogi
- 3. Dan Suciu
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057797415 |
| 103 | ULDBs: Databases with Uncertainty and Lineage | 2006 | VLDB | 0.00049520051 |
| 224 | CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies | 2004 | SIGMOD | 0.00032743209 |
| 453 | The Theory Of Probabilistic Databases | 1987 | VLDB | 0.00022801484 |
| 630 | Management of Probabilistic Data: Foundations and Challenges | 2007 | PODS | 0.00018942778 |
| 1,269 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012911894 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
| 5,270 | Probabilistic Databases with MarkoViews | 2012 | VLDB | 5.5925747e-05 |
| 2,733 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD | 8.2106718e-05 |
| 7,538 | A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries | 2021 | PODS | 4.7121279e-05 |
| 13,294 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB | - |
| 7,604 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.6944524e-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 |
| 4,722 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.9646931e-05 |
| 6,167 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1725053e-05 |