Implementing Query Completeness Reasoning

Data completeness is commonly regarded as one of the key aspectsof data quality. With this paper we make two main contributions: (i)we develop techniques to reason about the completeness of a queryanswer over a partially complete database, taking into account con-straints that hold over the database, and (ii) we implement themby an encoding into logic programming paradigms. As constraintswe consider primary and foreign keys as well as finite domain con-straints. In this way we can identify more situations in which aquery is complete than was possible with previous work. For eachcombination of constraints, we establish characterizations of thecompleteness reasoning and we show how to translate them intologic programs. To deal with the case when a query is incomplete,we compute a more general query, which contains all answers ofthe original query, but that is complete. As a proof of concept weran our encodings against test cases that capture characteristics ofa real-world scenario.status: publishe