Solutions and query rewriting in data exchange
From MaRDI portal
Publication:388220
DOI10.1016/j.ic.2013.06.002zbMath1358.68156OpenAlexW2117326010MaRDI QIDQ388220
Pablo Barceló, Ronald Fagin, Marcelo Arenas, Leonid O. Libkin
Publication date: 19 December 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.06.002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data exchange and schema mappings in open and closed worlds
- Data exchange: semantics and query answering
- The core of a graph
- Elements of finite model theory.
- Counting quantifiers, successor relations, and logarithmic space
- Counting modulo quantifiers on finite structures
- On monadic NP vs monadic co-NP
- On winning strategies with unary quantifiers
- Relational and XML Data Exchange
- An application of games to the completeness problem for formalized theories
- Efficient core computation in data exchange
- Data exchange: getting to the core
- Incomplete Information in Relational Databases
- A Proof Procedure for Data Dependencies
- Horn clauses and database dependencies
- Notions of locality and their logical characterizations over finite models
This page was built for publication: Solutions and query rewriting in data exchange