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
- 1. Christoph Berkholz (Humboldt University of Berlin)
- 2. Maximilian Merz (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{berkholz_pods21,
address = {New York, NY, USA},
series = {{PODS} '21},
title = {{Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration}},
url = {https://dl.acm.org/doi/10.1145/3452021.3458326},
doi = {10.1145/3452021.3458326},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Berkholz, Christoph and Merz, Maximilian},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,183 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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 | 7,711 | Optimizing Probabilistic Query Processing on Continuous Uncertain Data | 2011 | VLDB |
| 2 | 2,831 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD |
| 3 | 9,845 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS |
| 4 | 7,317 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 5 | 7,430 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS |
| 6 | 5,225 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB |
| 7 | 6,732 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS |
| 8 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 9 | 4,301 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 10 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |