DBScholar

Back to papers

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)

Paper ID
1853
Venue
PODS
Year
2021
Pagerank
5.214913e-05
Overall Rank
9,819 | 32.64%
DOI
10.1145/3452021.3458326

Incoming Non-self Citations Over Time

Authors

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