ABSTRACT
Data-Exchange is the problem of creating new databases according to a high-level specification called a schema-mapping while preserving the information encoded in a source database. This paper introduces a notion of generalized schema-mapping that enriches the standard schema-mappings (as defined by Fagin et al) with more expressive power. It then proposes a more general and arguably more intuitive notion of semantics that rely on three criteria: Soundness, Completeness and Laconicity (non-redundancy and minimal size). These semantics are shown to coincide precisely with the notion of cores of universal solutions in the framework of Fagin, Kolaitis and Popa. It is also well-defined and of interest for larger classes of schema-mappings and more expressive source databases (with null-values and equality constraints). After an investigation of the key properties of generalized schema-mappings and their semantics, a criterion called Termination of the Oblivious Chase (TOC) is identified that ensures polynomial data-complexity. This criterion strictly generalizes the previously known criterion of Weak-Acyclicity. To prove the tractability of TOC schema-mappings, a new polynomial time algorithm is provided that, unlike the algorithm of Gottlob and Nash from which it is inspired, does not rely on the syntactic property of Weak-Acyclicity. As the problem of deciding whether a Schema-mapping satisfies the TOC criterion is only recursively enumerable, a more restrictive criterion called Super-weak Acylicity (SwA) is identified that can be decided in Polynomial-time while generalizing substantially the notion of Weak-Acyclicity.
- ]]A. Deutsch, A. Nash, and J. Remmel. The chase revisited. In PODS 2008. Google Scholar
Digital Library
- ]]A. Deutsch and V. Tannen. Reformulation of xml queries and constraints. In ICDT 2003. Google Scholar
Digital Library
- ]]R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In ICDT 2003, 2003. Google Scholar
Digital Library
- ]]R. Fagin, P. G. Kolaitis, and L. Popa. Data exchange: getting to the core. In ACM Trans. Database Syst., volume 30, pages 174--210. ACM Press, March 2005. Google Scholar
Digital Library
- ]]G. Gottlob. Computing cores for data exchange: new algorithms and practical solutions. In PODS '05, pages 148--159. ACM, 2005. Google Scholar
Digital Library
- ]]G. Gottlob and A. Nash. Data exchange: computing cores in polynomial time. In PODS 2006. Google Scholar
Digital Library
- ]]L. Lipkin and C. Sirangelo. Data-exchange and schema-mappings in open and closed worlds. In PODS 2008. Google Scholar
Digital Library
- ]]R. Pichler and V. Savenkov. Towards practical feasibility of core computation in data exchange. In LPAR 2008. Google Scholar
Digital Library
- ]]M. Schmidt, M. Meier, and G. Lausen. Foundations of sparql query optimization. In CoRR.Google Scholar
Index Terms
Generalized schema-mappings: from termination to tractability
Recommendations
Composing schema mappings: Second-order dependencies to the rescue
Special Issue: SIGMOD/PODS 2004A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). A fundamental problem is composing schema mappings: given ...
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and the inverse operator, are regarded as especially important. Progress on the ...
Quasi-inverses of schema mappings
PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsSchema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and the inverse operator, are regarded as especially important. Progress on the ...






Comments