Probabilistic Databases with an Infinite Open-World Assumption

Understand

Probabilistic databases (PDBs) introduce uncertainty into relational databases by specifying probabilities for several possible instances.

• Traditionally, they are finite probability spaces over database instances.
• Such finite PDBs inherently make a closed-world assumption: non-occurring facts are assumed to be impossible, rather than just unlikely.
• As convincingly argued by Ceylan et al.