AbstractIn databases, queries are usually defined on complete databases. In this paper we introduce and motivate the notion of extended queries that are defined on incomplete databases. We argue that the language of extended logic program is appropriate for representing extended queries. We show through examples that given a query, a particular extension of it has important characteristics which corresponds to removal of the CWA from the original specification of the query. We refer to this particular extension as the expansion of the original query. Normally queries are expressed as general logic programs. We develop an algorithm that given a general logic program (satisfying certain syntactic properties) expressing a query constructs an e...
International audienceThe term naive evaluation refers to evaluating queries over incomplete databas...
One of the most common scenarios of handling incomplete information occurs in relational databases. ...
A database query q is called additive if q(A U B) = q(A) U q(B) for domain-disjoint input databases ...
The aim of this thesis is to study the role played by negation in databases and to develop data mod...
AbstractAnswering queries over an incomplete database w.r.t. a set of constraints is an important co...
AbstractA logic program consists of a set of Horn clauses, and can be used to express a query on rel...
We present a system that computes for a query that may be incom-plete, complete approximations from ...
AbstractWe propose to extend Horn-clause terms by invisibly associating them with incomplete types, ...
Data completeness is commonly regarded as one of the key aspects of data quality. With this paper we...
Most of work on partial information in databases asks which operations of standard languages, like r...
AbstractSemistructured data occur in situations where information lacks a homogeneous structure and ...
International audienceBuilding reliable systems over partially complete data poses significant chall...
The term näıve evaluation refers to evaluating queries over incomplete databases as if nulls were u...
One of the most common scenarios of handling incomplete information occurs in relational databases. ...
The term näıve evaluation refers to evaluating queries over incomplete databases as if nulls were u...
International audienceThe term naive evaluation refers to evaluating queries over incomplete databas...
One of the most common scenarios of handling incomplete information occurs in relational databases. ...
A database query q is called additive if q(A U B) = q(A) U q(B) for domain-disjoint input databases ...
The aim of this thesis is to study the role played by negation in databases and to develop data mod...
AbstractAnswering queries over an incomplete database w.r.t. a set of constraints is an important co...
AbstractA logic program consists of a set of Horn clauses, and can be used to express a query on rel...
We present a system that computes for a query that may be incom-plete, complete approximations from ...
AbstractWe propose to extend Horn-clause terms by invisibly associating them with incomplete types, ...
Data completeness is commonly regarded as one of the key aspects of data quality. With this paper we...
Most of work on partial information in databases asks which operations of standard languages, like r...
AbstractSemistructured data occur in situations where information lacks a homogeneous structure and ...
International audienceBuilding reliable systems over partially complete data poses significant chall...
The term näıve evaluation refers to evaluating queries over incomplete databases as if nulls were u...
One of the most common scenarios of handling incomplete information occurs in relational databases. ...
The term näıve evaluation refers to evaluating queries over incomplete databases as if nulls were u...
International audienceThe term naive evaluation refers to evaluating queries over incomplete databas...
One of the most common scenarios of handling incomplete information occurs in relational databases. ...
A database query q is called additive if q(A U B) = q(A) U q(B) for domain-disjoint input databases ...