Schema mapping discovery from data instances

DOI10.1145/1667053.1667055MaRDI QIDQ3578189zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Georg Gottlob, Pierre Senellart

Publication date 14 July 2010

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1667053.1667055

zbMATH Keywords

complexitydata exchangeinstancematchschema mapping

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximation algorithms for schema-mapping discovery from data examples
• Learning schema mappings
• Schema mapping coverage
• Towards a general framework for effective solutions to the data mapping problem
• Discovering the Semantics of Relational Tables Through Mappings

Cited in

(14)

• Schema mapping coverage
• Coverings and matchings in r-partite hypergraphs
• Learning schema mappings
• Nearly optimal NP-hardness of vertex cover on k-uniform k-partite hypergraphs
• XML schema mappings, data exchange and metadata management
• Inverting schema mappings
• Towards a general framework for effective solutions to the data mapping problem
• scientific article; zbMATH DE number 1927146 (Why is no real title available?)
• Approximation algorithms for schema-mapping discovery from data examples
• Learning concepts definable in first-order logic with counting
• Conjunctive queries: unique characterizations and exact learnability
• The parameterized complexity of learning monadic second-order logic
• Learning aggregate queries defined by first-order logic with counting
• Towards knowledge exchange: state-of-the-art and open problems

This page was built for publication: Schema mapping discovery from data instances

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