Data exchange beyond complete data

@inproceedings{Arenas2011DataEB,
  title={Data exchange beyond complete data},
  author={Marcelo Arenas and Jorge P{\'e}rez and Juan L. Reutter},
  booktitle={PODS},
  year={2011}
}
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural for a typical database translation scenario, this restriction is gradually becoming an impediment to the development of a wide range of applications that need to exchange objects that admit several interpretations. In particular, we are motivated by two specific applications that go beyond the usual data exchange… 
Data exchange beyond complete data
TLDR
This article addresses the problem of exchanging information given by representation systems, which are essentially finite descriptions of (possibly infinite) sets of complete instances, and makes use of the classical semantics of mappings specified by sets of logical sentences to give a meaningful semantics to the notion of exchanging representatives.
Exchanging More than Complete Data
  • M. Arenas
  • Computer Science
    Description Logics
  • 2011
TLDR
This talk addresses the problem of exchanging information given by representation systems, which are essentially finite descriptions of (possibly infinite) sets of complete instances, and shows the robustness of the proposal by applying it to the problems of exchanging incomplete information and exchanging knowledge bases.
Data Sharing and Exchange: Semantics and Query Answering
TLDR
This thesis proposes a new setting – called DSE, for Data Sharing and Exchange – which allows the exchange of data between independent source and target applications that possess independent schemas, as well as independent yet related domains of constants.
Data Sharing and Exchange: General Data-Mapping Semantics
TLDR
This paper considers the data sharing and exchange problem between applications that store related data which do not necessarily possess the same meaning in settings where source instances are complete and do not contain unknown data.
Inference-Based Semantics in Data Exchange
TLDR
This paper proposes the inference-based semantics that solves many certain-answer anomalies existing in current data-exchange semantics and introduces a new mapping language between the source and the target schema based on annotated bidirectional dependencies (abd) and defines the semantics for this new language.
Getting Unique Solution in Data Exchange
  • Nhung Ngo
  • Computer Science
    Proc. VLDB Endow.
  • 2013
TLDR
This work introduces a theoretical framework where the problem is transformed to an abduction problem, namely, definability abduction, and applies the framework to relational data exchange setting and solves the problem by pointing out minimal solutions according to a specific semantic minimality criterion.
Representation systems for data exchange
TLDR
This work develops some new technical tools that allow it to prove that there is a class of '"CWA" strong representation systems in which reasoning is modulo isomorphic equivalence, and shows that the class of (first order) source-to-target tuple generating dependencies is closed under the stricter notion of composability.
Description Logic Knowledge Base Exchange
TLDR
Data exchange is a field of database theory that deals with transferring data between differently structured databases, with motivation coming from industry, and most of the results in the literature consider tuple generating dependencies (tgds) as the language to specify mappings.
Exchanging Description Logic Knowledge Bases
TLDR
A general framework of KB exchange is defined, and the problems of representing implicit source information in the target, and of computing different kinds of solutions are addressed, i.e., target KBs with specified properties, given a source KB and a mapping.
Exchanging OWL 2 QL Knowledge Bases
TLDR
The problem of computing universal solutions, identified as one of the most desirable translations to be materialized, is considered and a novel automata-theoretic technique is provided, and complexity results that range from NP to EXPTIME, while for the latter it is shown NLOGSPACE-completeness.
...
1
2
3
...

References

SHOWING 1-10 OF 85 REFERENCES
Data exchange beyond complete data
TLDR
This article addresses the problem of exchanging information given by representation systems, which are essentially finite descriptions of (possibly infinite) sets of complete instances, and makes use of the classical semantics of mappings specified by sets of logical sentences to give a meaningful semantics to the notion of exchanging representatives.
Data exchange: semantics and query answering
Data exchange and incomplete information
TLDR
This paper presents a concept of target solutions based on the closed world assumption, and shows that the space of all solutions has two extreme points: the canonical universal solution and the core, well studied in data exchange.
Reverse data exchange: coping with nulls
TLDR
A new framework for reverse data exchange is developed that supports source instances that may contain nulls, thus overcoming the semantic mismatch between source and target instances of the previous formalizations.
Data exchange: query answering for incomplete data sources
TLDR
It is proved that computing certain answers for unions of conjunctive queries can be done in polynomial time when the schema mapping contains constraints that consist of a weakly acyclic set of tuple-generating dependencies and equality- Generating dependencies.
The complexity of data exchange
TLDR
There is a provable exponential gap between the data complexity and the combined complexity of data exchange, and if, in addition to the source instance, the schema mapping is part of the input, then the existence-of-solutions problem becomes EXPTIME-complete.
Inverting Schema Mappings: Bridging the Gap between Theory and Practice
TLDR
This paper provides a polynomial time algorithm that computes the three inverse operators mentioned above given a mapping specified by a set of tuple-generating dependencies (tgds), and proposes a new and natural notion of inversion that overcomes this limitation.
Incomplete Information in Relational Databases
TLDR
There are precise conditions that should be satisfied in a semantically meaningful extension of the usual relational operators, such as projection, selection, union, and join, from operators on relations to operators on tables with “null values” of various kinds allowed.
Exchanging Description Logic Knowledge Bases
TLDR
A general framework of KB exchange is defined, and the problems of representing implicit source information in the target, and of computing different kinds of solutions are addressed, i.e., target KBs with specified properties, given a source KB and a mapping.
Structural characterizations of schema-mapping languages
TLDR
Structural characterizations are established to the effect that a schema mapping possesses certain structural properties if and only if it can be specified in a particular schema-mapping language.
...
1
2
3
4
5
...