Incomplete Information in Relational Databases
Journal of the ACM (JACM)
More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
On the representation and querying of sets of possible worlds
Selected papers of the workshop on Deductive database theory
On the complexity of propositional knowledge base revision, updates, and counterfactuals
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Preferred answer sets for extended logic programs
Artificial Intelligence
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Problem of Incomplete Information in Relational Databases
Problem of Incomplete Information in Relational Databases
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Data exchange and incomplete information
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Model management 2.0: manipulating richer mappings
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Quasi-inverses of schema mappings
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Data exchange and schema mappings in open and closed worlds
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: query answering for incomplete data sources
Proceedings of the 3rd international conference on Scalable information systems
Reverse data exchange: coping with nulls
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The recovery of a schema mapping: Bringing exchanged data back
ACM Transactions on Database Systems (TODS)
Inverting schema mappings: bridging the gap between theory and practice
Proceedings of the VLDB Endowment
Foundations of schema mapping management
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 4th International Workshop on Logic in Databases
Representation systems for data exchange
Proceedings of the 15th International Conference on Database Theory
Description logic knowledge base exchange
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Query language-based inverses of schema mappings: semantics, computation, and closure properties
The VLDB Journal — The International Journal on Very Large Data Bases
Schema mappings and data exchange for graph databases
Proceedings of the 16th International Conference on Database Theory
When is naive evaluation possible?
Proceedings of the 32nd symposium on Principles of database systems
The language of plain SO-tgds: Composition, inversion and structural properties
Journal of Computer and System Sciences
Data exchange beyond complete data
Journal of the ACM (JACM)
Getting unique solution in data exchange
Proceedings of the VLDB Endowment
Exchanging OWL 2 QL knowledge bases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
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 scenario: exchanging incomplete information and exchanging knowledge bases. In this paper, we propose a general framework for data exchange that can deal with these two applications. More specifically, we address the problem of exchanging information given by representation systems, which are essentially finite descriptions of (possibly infinite) sets of complete instances. We make use of the classical semantics of mappings specified by sets of logical sentences to give a meaningful semantics to the notion of exchanging representatives, from which the standard notions of solution, space of solutions, and universal solution naturally arise. We also introduce the notion of strong representation system for a class of mappings, that resembles the concept of strong representation system for a query language. We show the robustness of our proposal by applying it to the two applications mentioned above: exchanging incomplete information and exchanging knowledge bases, which are both instantiations of the exchanging problem for representation systems. We study these two applications in detail, presenting results regarding expressiveness, query answering and complexity of computing solutions, and also algorithms to materialize solutions.