Query languages for data exchange: beyond unions of conjunctive queries

DOI10.1007/s00224-010-9259-6zbMath1230.68066OpenAlexW2146329061MaRDI QIDQ639842

Marcelo Arenas, Pablo Barceló, Juan L. Reutter

Publication date: 11 October 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9259-6

zbMATH Keywords

computational complexitynegationdata complexityconjunctive queries\textsc{Datalog}

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

XML Schema Mappings ⋮ A Fuzzy Extension of Data Exchange

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data exchange and schema mappings in open and closed worlds
• Data exchange: semantics and query answering
• Elements of finite model theory.
• Data exchange: on the complexity of answering queries with inequalities
• On the complexity of single-rule datalog queries.
• Data exchange: getting to the core
• Incomplete Information in Relational Databases
• A Proof Procedure for Data Dependencies
• The classical decision problem.

This page was built for publication: Query languages for data exchange: beyond unions of conjunctive queries