Consistency checking and querying in probabilistic databases under integrity constraints

作者：

Highlights：

• We incorporate denial constraints into probabilistic relational databases (PDBs).

• The semantics of PDBs is the set of interpretations consistent with the constraints.

• We investigate the consistency checking and the query answering problems.

• Tractable and hard cases are identified.

• Tractability is shown to depend on the data and/or the syntax of constraints.

摘要

•We incorporate denial constraints into probabilistic relational databases (PDBs).•The semantics of PDBs is the set of interpretations consistent with the constraints.•We investigate the consistency checking and the query answering problems.•Tractable and hard cases are identified.•Tractability is shown to depend on the data and/or the syntax of constraints.

论文关键词：Probabilistic databases,Integrity constraints,Consistency checking

论文评审过程：Received 13 March 2013, Revised 11 April 2014, Accepted 16 April 2014, Available online 24 April 2014.

论文官网地址：https://doi.org/10.1016/j.jcss.2014.04.026