A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
On a monadic NP vs monadic co-NP
Information and Computation
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Information and Computation
On the completeness of object-creating database transformation languages
Journal of the ACM (JACM)
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Information and Computation - Special issue: logic and computational complexity
Object identity as a query language primitive
Journal of the ACM (JACM)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
EXPRESS: a data EXtraction, Processing, and Restructuring System
ACM Transactions on Database Systems (TODS)
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Theory of answering queries using views
ACM SIGMOD Record
Logics with aggregate operators
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
ILOG: Declarative Creation and Manipulation of Object Identifiers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Data exchange: getting to the core
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Consistent query answering under inclusion dependencies
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Data exchange and incomplete information
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
CWA-solutions for data exchange settings with target dependencies
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On reconciling data exchange, data integration, and peer data management
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Consistent data for inconsistent XML document
Information and Software Technology
XML data exchange: Consistency and query answering
Journal of the ACM (JACM)
Data exchange in the presence of arithmetic comparisons
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Inconsistency tolerance in P2P data integration: An epistemic logic approach
Information Systems
The recovery of a schema mapping: bringing exchanged data back
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Joining the results of heterogeneous search engines
Information Systems
Data exchange: query answering for incomplete data sources
Proceedings of the 3rd international conference on Scalable information systems
Query languages for data exchange: beyond unions of conjunctive queries
Proceedings of the 12th International Conference on Database Theory
Logical foundations of relational data exchange
ACM SIGMOD Record
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
Normalization and optimization of schema mappings
Proceedings of the VLDB Endowment
Locality of Queries and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
Answering non-monotonic queries in relational data exchange
Proceedings of the 13th International Conference on Database Theory
On the tradeoff between mapping and querying power in XML data exchange
Proceedings of the 13th International Conference on Database Theory
Logic and data exchange: which solutions are "good" solutions?
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
Proceedings of the 14th International Conference on Database Theory
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
Data exchange and schema mappings in open and closed worlds
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
Normalization and optimization of schema mappings
The VLDB Journal — The International Journal on Very Large Data Bases
Inconsistency tolerance in P2P data integration: an epistemic logic approach
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Datalog as a query language for data exchange systems
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Local transformations and conjunctive-query equivalence
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Data exchange in datalog is mainly a matter of choice
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
The definability abduction problem for data 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
Query processing under GLAV mappings for relational and graph databases
Proceedings of the VLDB Endowment
On simplification of schema mappings
Journal of Computer and System Sciences
Solutions and query rewriting in data exchange
Information and Computation
Getting unique solution in data exchange
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions - target instances that satisfy the constraints of the data exchange problem. Previous work has identified two classes of desirable solutions: canonical universal solutions, and their cores. Query answering in data exchange amounts to rewriting a query over the target schema to another query that, over a materialized target instance, gives the result that is semantically consistent with the source. A basic question is then whether there exists a transformation sending a source instance into a solution over which target queries can be answered.We show that the answer is negative for many data exchange transformations that have structural properties similar to canonical universal solutions and cores. Namely, we prove that many such transformations preserve the local structure of the data. Using this notion, we further show that every target query rewritable over such a transformation cannot distinguish tuples whose neighborhoods in the source are similar. This gives us a first tool that helps check whether a query is rewritable, We also show that these results are robust: they hold for an extension of relational calculus with grouping and aggregates, and for two different semantics of query answering.