References - Foundations of Data Exchange - page 322

Arenas, M., Barcelo, P., Fagin, R., and Libkin, L. 2013. Solutions and query rewriting in
data exchange. Information and Computation , 228(1), 28-61.
Arocena, P. C., Fuxman, A., and Miller, R. J. 2010. Composing local-as-view mappings:
Closure and applications. Pages 209-218 of: Proceedings of the 13th International
Conference on Database Theory (ICDT) .
Barcelo, P. 2009. Logical foundations of relational data exchange. SIGMOD Record , 38(1),
49-58.
Barcelo, P., Libkin, L., Poggi, A., and Sirangelo, C. 2010. XML with incomplete informa-
tion. Journal of the ACM , 58(1).
Benedikt, M., Fan, W., and Geerts, F. 2008. XPath satisfiability in the presence of DTDs.
Journal of the ACM , 55(2).
Bernstein, P. A. 2003. Applyingmodel management to classical meta-data problems. Pages
209-220 of: Conference on Innovative Data Systems Research (CIDR) .
Bernstein, P. A., and Melnik, S. 2007. Model management 2.0: Manipulating richer map-
pings. Pages 1-12 of: ACM SIGMOD Conference .
Bernstein, P. A., Green, T. J., Melnik, S., and Nash, A. 2008.

Implementing mapping

composition. VLDB J. , 17(2), 333-353.
Bex, G. J., Neven, F., and den Bussche, J. V. 2004. DTDs versus XML Schema: A practical
study. Pages 79-84 of: Proceedings of the WebDB Workshop .
Bj orklund, H., Martens, W., and Schwentick, T. 2008. Optimizing conjunctive queries over
trees using schema information. Pages 132-143 of: Proceedings of Mathematical
Foundations of Computer Science .
Bj orklund, H., Martens, W., and Schwentick, T. 2011. Conjunctive query containment over
trees. Journal of Computer and System Sciences , 77(3), 450-472.
Bojanczyk, M., Kołodziejczyk, L. A., and Murlak, F. 2011. Solutions in XML data ex-
change. Pages 102-113 of: Milo, T. (ed), International Conference on Database The-
ory (ICDT) .ACM.
Calvanese, D., Giacomo, G. D., Lenzerini, M., and Vardi, M. Y. 2011. Simplifying schema
mappings. Pages 114-125 of: Proceedings of the 14th International Conference on
Database Theory (ICDT) .
Chirkova, R., Libkin, L., and Reutter, J. 2012. Tractable XML data exchange via relations.
Frontiers of Computer Science , 6(3), 243-263.
Comon, H., Dauchet, M., Gilleron, R., Loding, C., Jacquemard, F., Lugiez, D., Tison, S.,
and Tommasi, M. 2007. Tree Automata Techniques and Applications . Available on:
http://www.grappa.univ-lille3.fr/tata . Released October, 12th 2007.
David, C. 2008. Complexity of data tree patterns over XML documents. Pages 278-289
of: Proceedings of Mathematical Foundations of Computer Science .
David, C., Libkin, L., and Murlak, F. 2010. Certain answers for XML queries. Pages
191-202 of: ACM Symposium on Principles of Database Systems (PODS) .
de Rougemont, M., and Vieilleribiere, A. 2007. Approximate data exchange. Pages 44-58
of: International Conference on Database Theory (ICDT) .
Deutsch, A., and Tannen, V. 2003. Reformulation of XML queries and constraints. Pages
225-241 of: International Conference on Database Theory (ICDT) .
Deutsch, A., Nash, A., and Remmel, J. 2008. The chase revisited. Pages 149-158 of: ACM
Symposium on Principles of Database Systems (PODS) .
Doan, A., Halevy, A., and Ives, Z. 2012. Principles of Data Integration . Morgan Kauf-
mann.