Database Paper Browser

Back to papers

Probabilistic Databases with an Infinite Open-World Assumption

Summary: Framework for open-world PDBs over countably infinite universes with finite instances, removing closed-world artifacts. Constructive existence/characterization of countable tuple-independent (and BID) PDBs; lift finite-query evaluation to obtain arbitrarily small additive approximations. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1743
Venue
PODS
Year
2019
Pagerank
5.1854833e-05
Overall Rank
6,147 | 57.24%
DOI
10.1145/3294052.3319681

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
299 Trio: A System for Data, Uncertainty, and Lineage 2006 VLDB 0.00028525071
321 MCDB: A Monte Carlo Approach to Managing Uncertain Data 2008 SIGMOD 0.00027527389
706 MYSTIQ: A system for finding more answers by using probabilities 2005 SIGMOD 0.00017845469
2,875 MayBMS: A Probabilistic Database Management System 2009 SIGMOD 7.9742313e-05
6,284 Probabilistic XML via Markov Chains 2010 VLDB 5.128131e-05
Previous Page 1 / 1 Next

Semantically Similar Papers