Database Paper Browser

Back to papers

Approximate Lifted Inference with Probabilistic Databases

Summary: Approximate evaluation of #P-hard queries in probabilistic DBs via upper-bound plans; take the minimum. Schema-aware pruning keeps essential plans; safety iff a single plan, generalizing PTIME CQ results; 3 optimization techniques speed min-safe-plan evaluation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11174
Venue
VLDB
Year
2015
Pagerank
5.1716068e-05
Overall Rank
6,169 | 57.09%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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