Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration
Summary: Dynamicize lifted inference: for tuple-independent PDBs, maintain any safe UCQ's probability under single-tuple updates in constant time. For non-Boolean queries, develop lifted rules and a dynamic structure for log-time updates and log-delay ranked enumeration, with an OMv-tight non-repeating CQ frontier. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 726 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00014707915 |
| 770 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00014217445 |
| 3,179 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 7.7369605e-05 |
| 3,308 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 7.5990326e-05 |
| 5,232 | Conjunctive Queries with Inequalities Under Updates | 2018 | VLDB | 6.376792e-05 |
| 5,449 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 6.2835833e-05 |
| 5,915 | Probabilistic Databases with an Infinite Open-World Assumption | 2019 | PODS | 6.1052485e-05 |
| 6,443 | Probabilistic Databases for All | 2020 | PODS | 5.9385024e-05 |
| 7,058 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 5.7675334e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,588 | Optimizing Probabilistic Query Processing on Continuous Uncertain Data | 2011 | VLDB | 5.6467067e-05 |
| 2,839 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD | 8.1117137e-05 |
| 9,694 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS | 5.2900821e-05 |
| 7,138 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 5.7486312e-05 |
| 7,058 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 5.7675334e-05 |
| 5,920 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 6.1044584e-05 |
| 8,306 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS | 5.5105022e-05 |
| 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00043653232 |
| 4,273 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 6.8587835e-05 |
| 726 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00014707915 |