Relaxed notions of schema mapping equivalence revisited

DOI10.1007/s00224-012-9397-0zbMath1270.68105OpenAlexW2052532675MaRDI QIDQ359884

Reinhard Pichler, Vadim Savenkov, Emanuel Sallinger

Publication date: 23 August 2013

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.6981

zbMATH Keywords

data integrationequivalence of schema mappingsschema mapping optimization

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey

Cites Work

• XML queries and constraints, containment and reformulation
• Data exchange: semantics and query answering
• Testing containment of conjunctive queries under functional and inclusion dependencies
• On the complexity of single-rule datalog queries.
• Generic model management. Concepts and algorithms.
• Towards practical feasibility of core computation in data exchange
• Composition with Target Constraints
• Data exchange: getting to the core
• Inverting schema mappings
• A Proof Procedure for Data Dependencies
• Horn clauses and database dependencies
• Equivalence of Datalog queries is undecidable
• Recursive query plans for data integration