Relaxed notions of schema mapping equivalence revisited

DOI10.1007/S00224-012-9397-0zbMATH Open1270.68105OpenAlexW2052532675MaRDI QIDQ359884FDOQ359884

Authors: Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov 

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

Recommendations

• scientific article; zbMATH DE number 4058918
• On simplification of schema mappings
• Equivalence of keyed relational schemas by conjunctive queries
• Schema mapping coverage
• Composition with target constraints

zbMATH Keywords

data integrationequivalence of schema mappingsschema mapping optimization

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

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

Cited In (5)

• Composition with target constraints
• Title not available (Why is that?)
• Inseparability and conservative extensions of description logic ontologies: a survey
• On simplification of schema mappings
• The language of plain SO-tgds: composition, inversion and structural properties

This page was built for publication: Relaxed notions of schema mapping equivalence revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359884)