The Definability Abduction Problem for Data Exchange

Franconi, Enrico; Ngo, Nhung; Sherkhonov, Evgeny

doi:10.1007/978-3-642-33203-6_18

Cited by 5 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concurrently, we are exploring the problem of fixing real ontologies in order to enforce definability when it is known it should be the case (Franconi, Ngo, & Sherkhonov, 2012c). This happens when it is intuitively obvious that the answer of a query can be found from the available data (that is, the query is definable from the database), but the mediating ontology does not entail the definability.…”

Section: Discussionmentioning

confidence: 99%

Exact Query Reformulation over Databases with First-order and Description Logics Ontologies

Franconi

Kerhet

Ngo

2013

jair

View full text Add to dashboard Cite

We study a general framework for query rewriting in the presence of an arbitrary first-order logic ontology over a database signature. The framework supports deciding the existence of a safe-range first-order equivalent reformulation of a query in terms of the database signature, and if so, it provides an effective approach to construct the reformulation based on interpolation using standard theorem proving techniques (e.g., tableau). Since the reformulation is a safe-range formula, it is effectively executable as an SQL query. At the end, we present a non-trivial application of the framework with ontologies in the very expressive ALCHOIQ description logic, by providing effective means to compute safe-range first-order exact reformulations of queries.

show abstract

Section: Discussionmentioning

confidence: 99%

Exact Query Reformulation over Databases with First-order and Description Logics Ontologies

Franconi

Kerhet

Ngo

2013

jair

View full text Add to dashboard Cite

show abstract

“…Indeed, no schema mapping in DE has a unique inverse, although under certain circumstances there is, among the others, only one inverse with a specific form [10]. The case in which there is a unique target instance for a given source instance under the schema mapping, namely when schema mappings can be transformed into proper view mappings via an abduction process, is analysed in [15].…”

Section: Related Workmentioning

confidence: 99%

The View Update Problem Revisited

Franconi¹,

Guagliardo²

2012

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we revisit the view update problem in a relational setting and propose a framework based on the notion of determinacy under constraints. Within such a framework, we characterise when a view mapping is invertible, establishing that this is the case precisely when each database symbol has an exact rewriting in terms of the view symbols under the given constraints, and we provide a general effective criterion to understand whether the changes introduced by a view update can be propagated to the underlying database relations in a unique and unambiguous way.Afterwards, we show how determinacy under constraints can be checked, and rewritings effectively found, in three different relevant scenarios in the absence of view constraints. First, we settle the long-standing open issue of how to solve the view update problem in a multirelational database with views that are projections of joins of relations, and we do so in a more general setting where views are defined by arbitrary conjunctive queries and database constraints are stratified embedded dependencies. Next, we study a setting based on horizontal decompositions of a single database relation, where views are defined by selections on possibly interpreted attributes (e.g., arithmetic comparisons) in the presence of domain constraints over the database schema. Lastly, we look into another multi-relational database setting, where views are defined in an expressive Type Relational Algebra based on the n-ary Description Logic DLR and database constraints are inclusions of expressions in that algebra.

show abstract

Effective Query Answering with Ontologies and DBoxes

Franconi

Kerhet

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The Definability Abduction Problem for Data Exchange

Cited by 5 publications

References 9 publications

Exact Query Reformulation over Databases with First-order and Description Logics Ontologies

Exact Query Reformulation over Databases with First-order and Description Logics Ontologies

The View Update Problem Revisited

Effective Query Answering with Ontologies and DBoxes

Contact Info

Product

Resources

About