Abstract
Considering that the unranked tree languages L(G) and L(G′) are those defined by given possibly-recursive XML types G and G′, this paper proposes a method to verify whether L(G) is “approximatively” included in L(G′). The approximation consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amavi, J.: Comparaison des langages d’arbres pour la substitution de services web (in French). Tech. Rep. RR-2010-13, LIFO, Université d’Orléans (2010)
Amavi, J., Bouchou, B., Savary, A.: On correcting XML documents with respect to a schema. Tech. Rep. 301, LI, Université de Tours (2012)
Amavi, J., Chabin, J., Halfeld Ferrari, M., Réty, P.: Weak Inclusion for XML Types. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 30–41. Springer, Heidelberg (2011)
Amavi, J., Chabin, J., Réty, P.: Weak inclusion for recursive XML types (full version). Tech. Rep. RR-2012-02, LIFO, Université d’Orléans (2012), http://www.univ-orleans.fr/lifo/prodsci/rapports/RR/RR2012/RR-2012-02.pdf
Bille, P., Li Gørtz, I.: The Tree Inclusion Problem: In Optimal Space and Faster. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 66–77. Springer, Heidelberg (2005)
Champavère, J., Gilleron, R., Lemay, A., Niehren, J.: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 184–195. Springer, Heidelberg (2008)
Chen, Y., Shi, Y., Chen, Y.: Tree inclusion algorithm, signatures and evaluation of path-oriented queries. In: Symp. on Applied Computing, pp. 1020–1025 (2006)
Colazzo, D., Ghelli, G., Pardini, L., Sartiani, C.: Linear inclusion for XML regular expression types. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM, pp. 137–146. ACM Digital Library (2009)
Colazzo, D., Ghelli, G., Sartiani, C.: Efficient asymmetric inclusion between regular expression types. In: Proceeding of International Conference of Database Theory, ICDT, pp. 174–182. ACM Digital Library (2009)
Courcelle, B.: On constructing obstruction sets of words. Bulletin of the EATCS 44, 178–185 (1991)
Jacquemard, F., Rusinowitch, M.: Closure of Hedge-Automata Languages by Hedge Rewriting. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 157–171. Springer, Heidelberg (2008)
Kilpeläinen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comput. 24(2), 340–356 (1995)
Mani, M., Lee, D.: XML to Relational Conversion Using Theory of Regular Tree Grammars. In: Bressan, S., Chaudhri, A.B., Li Lee, M., Yu, J.X., Lacroix, Z. (eds.) EEXTT and DIWeb 2002. LNCS, vol. 2590, pp. 81–103. Springer, Heidelberg (2003)
Martens, W., Neven, F., Schwentick, T.: Complexity of Decision Problems for Simple Regular Expressions. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 889–900. Springer, Heidelberg (2004)
Richter, T.: A New Algorithm for the Ordered Tree Inclusion Problem. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 150–166. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amavi, J., Chabin, J., Réty, P. (2012). Weak Inclusion for Recursive XML Types. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)