Data exchange: getting to the core
By Ronald Fagin, Phokion G. Kolaitis, Lucian Popa. TODS, 2003
430 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/1b7c794a96b53dadc777aaee5a7dab59d302636a
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
- Phokion G. Kolaitis
- Alon Y. Halevy
- Wang Chiew Tan
- Michael Schmidt
- Xin Luna Dong
- Lucian Popa
- Cong Yu
- Ronald Fagin
In Computer Networks and Communications
- Phokion G. Kolaitis
- Alon Y. Halevy
- Wang Chiew Tan
- Michael Schmidt
- Xin Luna Dong
- Lucian Popa
- Cong Yu
- Ronald Fagin
Citations in the corpus
- Semantics : Science , Services and Agents on the World Wide Web (2014, background): “In fact, from these results [13,14], it is possible to conclude that the complexity of the problem of verifying whether or not an RDF graph G is lean, is coNP-complete, as demonstrated previously by Gutierrez et al.”
- Data integration with uncertainty (2007, methodology): “Proof For each possible GLAV mapping m ∈ pGM , generating the core universal solution takes polynomial time [ 11 ] in the size of the data and the size of m. The number of core universal solutions we need to generate is the same as the number of possible mappings in pGM . Thus, generating the by-tab”
- Foundations of semantic web databases (2004, background): “Similar notions have been investigated in other contexts [12, 11, 7].”
- The chase revisited (2008, methodology): “However, we hope that the techniques for computing cores of chase results in [14, 16] can be applied to improve efficiency.”
- Data exchange: semantics and query answering (2003, background): “In a follow-up paper [16], we address this question and answer it by considering the well-known notion of the core of a structure, a notion that was first studied in graph theory (see, for instance, [19]), but has also played a role in conjunctive-query processing [8].”
- Composing schema mappings: second-order dependencies to the rescue (2004, methodology): “Note also that the terminology “J is a solution for I” comes from [10, 11], where J is a solution to the data exchange problem associated with the mapping M and the source instance I.”
- Schema mappings, data exchange, and metadata management (2005, methodology): “Most of the results presented here are based on joint work with Ronald Fagin, Ren´ee J. Miller, Lu-cian Popa, and Wang-Chiew Tan reported in [13, 14, 15].”