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 | 4.1945683e-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 |
|---|---|---|---|---|
| 772 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00016876498 |
| 1,056 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.0001441128 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |
| 3,781 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 6.7723513e-05 |
| 5,055 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 5.7312839e-05 |
| 5,576 | Conjunctive Queries with Inequalities Under Updates | 2018 | VLDB | 5.426344e-05 |
| 6,147 | Probabilistic Databases with an Infinite Open-World Assumption | 2019 | PODS | 5.1854833e-05 |
| 6,683 | Probabilistic Databases for All | 2020 | PODS | 4.9638979e-05 |
| 7,149 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 4.8173876e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,623 | Optimizing Probabilistic Query Processing on Continuous Uncertain Data | 2011 | VLDB | 4.6933659e-05 |
| 2,728 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD | 8.2185032e-05 |
| 9,707 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS | 4.299267e-05 |
| 7,163 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 4.8132033e-05 |
| 7,149 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 4.8173876e-05 |
| 6,169 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1716068e-05 |
| 8,437 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS | 4.5138778e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057857292 |
| 4,720 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.973811e-05 |
| 772 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00016876498 |