Database Paper Browser

Back to papers

Anytime Approximation in Probabilistic Databases via Scaled Dissociations

Summary: Introduces an anytime branch-and-bound approximation scheme for probabilistic databases, unifying PDB and SRL model-based methods. Scaled dissociation tightens bounds for self-join-free CQ queries on tuple-independent PDBs, cutting approximation error. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5712
Venue
SIGMOD
Year
2019
Pagerank
4.492241e-05
Overall Rank
8,581 | 40.31%
DOI
10.1145/3299869.3319900

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
5,855 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 5.3006096e-05
8,508 Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries 2024 PODS 4.4952414e-05
10,377 FastPDB: Towards Bag-Probabilistic Queries at Interactive Speeds 2025 SIGMOD 4.1945683e-05
11,179 Probabilistic Reasoning at Scale: Trigger Graphs to the Rescue 2023 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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