Composing Schema Mappings: Second-Order Dependencies to the Rescue
@inproceedings{Fagin2004ComposingSM, title={Composing Schema Mappings: Second-Order Dependencies to the Rescue}, author={Ronald Fagin and Phokion G. Kolaitis and L. Popa and W. Tan}, booktitle={PODS}, year={2004} }
A 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 two successive schema mappings, derive a schema mapping between the source schema of the first and the target schema of the second that has the same effect as applying successively the two schema mappings.In this article, we give a rigorous… CONTINUE READING
Topics from this paper
255 Citations
Structural characterizations of schema-mapping languages
- Mathematics, Computer Science
- ICDT '09
- 2009
- 73
- PDF
References
SHOWING 1-7 OF 7 REFERENCES
Complexity of answering queries using materialized views
- Computer Science
- PODS '98
- 1998
- 563
- Highly Influential
- PDF
Formal Systems for Tuple and Equality Generating Dependencies
- Mathematics, Computer Science
- SIAM J. Comput.
- 1984
- 113
- Highly Influential
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Mathematics, Computer Science
- SIAM J. Comput.
- 1998
- 1,006
- Highly Influential
- PDF
Applying Model Management to Classical Meta Data Problems
- Computer Science
- CIDR
- 2003
- 592
- Highly Influential
- PDF