Composing schema mappings: second-order dependencies to the rescue
By Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004
305 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Signal Processing
View Paper: https://www.semanticscholar.org/paper/5bf1ce853f4acffb9e7036247374f19e01134cec
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Pavel Shvaiko
- Jérôme Euzenat
- Philip A. Bernstein
- Alon Y. Halevy
- Sergey Melnik
- Phokion G. Kolaitis
- Xin Luna Dong
- Cong Yu
In Computer Networks and Communications
- Pavel Shvaiko
- Jérôme Euzenat
- Philip A. Bernstein
- Phokion G. Kolaitis
- Sergey Melnik
- Alon Y. Halevy
- Xin Luna Dong
- Cong Yu
In Signal Processing
- Philip A. Bernstein
- Phokion G. Kolaitis
- Pavel Shvaiko
- Jérôme Euzenat
- Xin Luna Dong
- Sergey Melnik
- Cong Yu
- Alon Y. Halevy
Citations in the corpus
- Data integration with uncertainty (2007, background): “Composition and inversion of mappings have received significant attention recently [5,10, 12 ,26] because they are fundamental operations on mappings and they are important for data exchange, integration and peer data management.”
- Clio grows up: from research prototype to industrial tool (2005, methodology): “Hence, the schema mapping language used in Clio includes Skolem functions; the resulting language is a nested relational variation of the language of second-order tgds of Fagin et al [ 2 ].”
- Ontology Matching (2007, methodology): “To this end, Clio also supports mapping composition (Fagin et al. 2005).”
- Ten Challenges for Ontology Matching (2008, result): “The problem here is to design a composition operator that guarantees that the successive applications of two mappings yields the same results as the application of their composition [ 26 ].”
- Schema mappings, data exchange, and metadata management (2005, methodology): “Indeed, as described in [15], we can write a fixed first-order sentence specifying a schema mapping M ∗ such that a solution J exists for a source instance I if and only if I is the encoding of a Turing machine and J is the encoding of a terminating computation on some input.”
- Data integration: the teenage years (2006, background): “Some of the operators that have been considered in Model Management include the creation of mappings, inverting and composing mappings [41, 77, 85], merging schemas [93] and schema dif-”
- Model management 2.0: manipulating richer mappings (2007, background): “Model management operations include Match, ModelGen, TransGen, Compose, Diff, Merge and several others.”