S. Abiteboul, O. Benjelloun, and T. Milo, Positive active XML, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '04, pp.35-45, 2004.
DOI : 10.1145/1055558.1055564

S. Abiteboul, P. Bourhis, and B. Marinoiu, Satisfiability and relevance for queries over active documents, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.87-96, 2009.
DOI : 10.1145/1559795.1559810

URL : https://hal.archives-ouvertes.fr/inria-00429645

S. Abiteboul, I. Manolescu, and E. Taropa, A Framework for Distributed XML Data Management, EDBT, pp.1049-1058, 2006.
DOI : 10.1007/11687238_61

URL : https://hal.archives-ouvertes.fr/inria-00001033

S. Abiteboul, I. Manolescu, and S. Zoupanos, OptimAX: Optimizing Distributed ActiveXML Applications, 2008 Eighth International Conference on Web Engineering, pp.299-310, 2008.
DOI : 10.1109/ICWE.2008.11

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Abiteboul, B. Cate, and Y. Katsis, On the equivalence of distributed systems with queries and communication, ICDT, pp.126-137, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00879029

S. Amer-yahia, S. Cho, L. V. Lakshmanan, and D. Srivastava, Minimization of Tree Pattern Queries, SIGMOD, pp.497-508, 2001.

M. Benedikt and C. Koch, XPath leashed, ACM Computing Surveys, vol.41, issue.1, pp.1-54, 2008.
DOI : 10.1145/1456650.1456653

A. K. Chandra and P. M. Merlin, Optimal implementation of conjunctive queries in relational data bases, Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77, pp.77-90, 1977.
DOI : 10.1145/800105.803397

V. Dalmau, P. G. Kolaitis, and M. Y. Vardi, Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics, CP, pp.310-326, 2002.
DOI : 10.1007/3-540-46135-3_21

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Figueira, Satisfiability of downward XPath with data equality tests, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, 2009.
DOI : 10.1145/1559795.1559827

E. C. Freuder, Complexity of K-Tree Structured Constraint Satisfaction Problems, AAAI, pp.4-9, 1990.

G. Gottlob and C. Koch, Monadic datalog and the expressive power of languages for Web information extraction, Journal of the ACM, vol.51, issue.1, pp.74-113, 2004.
DOI : 10.1145/962446.962450

P. Hell and J. Ne?et?il, The core of a graph, Discrete Mathematics, vol.109, issue.1-3, pp.117-126, 1992.
DOI : 10.1016/0012-365X(92)90282-K

M. T. Ozsu and P. Valduriez, Principles of Distributed Database Systems, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00483354

K. Wagner, Bounded Query Classes, SIAM Journal on Computing, vol.19, issue.5, pp.833-846, 1990.
DOI : 10.1137/0219058

K. W. Wagner, More complicated questions about maxima and minima, and some closures of NP, Theoretical Computer Science, vol.51, issue.1-2, pp.53-80, 1987.
DOI : 10.1016/0304-3975(87)90049-1