On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases

@inproceedings{Wijsen2010OnTF,
  title={On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases},
  author={Jef Wijsen},
  booktitle={PODS},
  year={2010}
}
A natural way for capturing uncertainty in the relational data model is by having relations that violate their primary key constraint, that is, relations in which distinct tuples agree on the primary key. A repair (or possible world) of a database is then obtained by selecting a maximal number of tuples without ever selecting two distinct tuples that have the same primary key value. For a Boolean query q, CERTAINTY(q) is the problem that takes as input a database db and asks whether q evaluates… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…