S. Abiteboul, O. Benjelloun, and T. Milo, The Active XML project: an overview, The VLDB Journal, vol.7, issue.4, pp.1019-1040, 2008.
DOI : 10.1007/s00778-007-0049-y

S. Abiteboul, A. Bonifati, G. Cobéna, I. Manolescu, and T. Milo, Dynamic XML documents with distribution and replication, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.527-538, 2003.
DOI : 10.1145/872757.872821

S. Abiteboul, I. Manolescu, and E. Taropa, A Framework for Distributed XML Data Management, Lecture Notes in Computer Science, vol.3896, pp.1049-1058, 2006.
DOI : 10.1007/11687238_61
URL : https://hal.archives-ouvertes.fr/inria-00001033

S. Abiteboul, T. Milo, and O. Benjelloun, Regular rewriting of active XML and unambiguity, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, 2005.
DOI : 10.1145/1065167.1065204

J. Bremer and M. Gertz, On distributing XML repositories, WebDB, pp.73-78, 2003.

S. Ceri, P. Fraternali, and A. Bongio, Web Modeling Language (WebML): a modeling language for designing Web sites, Computer Networks, vol.33, issue.1-6, pp.1-6137, 2000.
DOI : 10.1016/S1389-1286(00)00040-2

S. Ceri, B. Pernici, and G. Wiederhold, An overview of research in the design of distributed databases, IEEE Database Eng. Bull, vol.7, issue.4, pp.46-51, 1984.

G. Ghelli, D. Colazzo, and C. Sartiani, Efficient Inclusion for a Class of XML Types with Interleaving and Counting, Lecture Notes in Computer Science, vol.4797, pp.231-245, 2007.
DOI : 10.1007/978-3-540-75987-4_16
URL : https://hal.archives-ouvertes.fr/inria-00535983

P. Grosso and D. Veillard, XML fragment interchange, W3C Candidate Recommendation 12, 2001.

]. C. Hagenah and A. Muscholl, Computing epsilon-free NFA from regular expressions in o(n log 2 (n)) time, MFCS '98: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, pp.277-285, 1998.

L. O. Hernández and M. Pegah, WebDAV, Proceedings of the 31st annual ACM SIGUCCS conference on User services , SIGUCCS '03, pp.249-254, 2003.
DOI : 10.1145/947469.947535

M. Holzer and M. Kutrib, State Complexity of Basic Operations on Nondeterministic Finite Automata, CIAA, pp.148-157, 2002.
DOI : 10.1007/3-540-44977-9_14

J. Hromkovic, S. Seibert, and T. Wilke, Translating regular expressions into small epsilon-free nondeterministic finite automata, STACS '97: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pp.55-66, 1997.

H. V. Jagadish, L. V. Lakshmanan, T. Milo, D. Srivastava, and D. Vista, Querying network directories, ACM SIGMOD Record, vol.28, issue.2, pp.133-144, 1999.
DOI : 10.1145/304181.304194

W. Martens, F. Neven, T. Schwentick, M. T. Ozsu, and P. Valduriez, Complexity of Decision Problems for Simple Regular Expressions, Lecture Notes in Computer Science Computer, vol.3153, issue.8, pp.889-900, 1991.
DOI : 10.1007/978-3-540-28629-5_70

Y. Papakonstantinou and V. Vianu, DTD inference for views of XML data, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '00, pp.35-46, 2000.
DOI : 10.1145/335168.335173

W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X

H. Seidl, Deciding Equivalence of Finite Tree Automata, SIAM Journal on Computing, vol.19, issue.3, pp.424-437, 1990.
DOI : 10.1137/0219027

L. J. Stockmeyer and A. R. Meyer, Word problems requiring exponential time(Preliminary Report), Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.1-9, 1973.
DOI : 10.1145/800125.804029

D. Suciu, Typechecking for Semistructured Data, DBPL '01: Revised Papers from the 8th International Workshop on Database Programming Languages, pp.1-20, 2002.
DOI : 10.1007/3-540-46093-4_1

H. Thompson, D. Beech, M. Maloney, and N. Mendelsohn, XML schema part 1: Structures second edition Recommendation, World Wide Web Consortium, 2004.

M. Veanes, On computational complexity of basic decision problems of finite tree automata, 1997.