Abstract
In this paper, we propose algorithms that extend a given regular tree grammar G 0 to a new grammar G respecting the following two properties: (i) G belongs to the sub-class of local or single-type tree grammars and (ii) G is the least grammar (in the sense of language inclusion) that contains the language of G 0. Our algorithms give rise to important tools in the context of web service composition or XML schema evolution. We are particularly interested in applying them in order to reconcile different XML type messages among services. The algorithms are proven correct and some of their applications are discussed.
Supported by: Codex ANR-08-DEFIS-04, e-cloudss (LACCIR), CAPES 3164/08-0.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Gottlob, G., Manna, M.: Distributed XML design. In: PODS 2009: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 247–258. ACM, New York (2009)
Angluin, D.: Computational learning theory: survey and selected bibliography. In: STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 351–369. ACM, New York (1992)
Bouchou, B., Duarte, D., Halfeld Ferrari, M., Musicante, M.A.: Extending XML Types Using Updates. In: Hung (ed.) Services and Business Computing Solutions with XML: Applications for Quality Management and Best Processes, pp. 1–21. IGI Global (2009)
Bouchou, B., Duarte, D., Halfeld Ferrari, M., Laurent, D., Musicante, M.A.: Schema evolution for XML: A consistency-preserving approach. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 876–888. Springer, Heidelberg (2004)
Besombes, J., Marion, J.-Y.: Apprentissage des langages réguliers d’arbres et applications. Traitement automatique de langues 44(1), 121–153 (2003)
Besombes, J., Marion, J.-Y.: Learning tree languages from positive examples and membership queries. Theoretical Computer Science (2006)
Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of concise DTDs from XML data. In: VLDB, pp. 115–126 (2006)
Bex, G.J., Neven, F., Vansummeren, S.: Inferring XML schema definitions from XML data. In: VLDB, pp. 998–1009 (2007)
Chidloviskii, B.: Schema extraction from XMLS data: A grammatical inference approach (2001)
Chabin, J., Halfeld Ferrari, M., Musicante, M.A., Réty, P.: A software to transform a RTG into a LTG or a STTG (2010), http://www.univ-orleans.fr/lifo/Members/rety/logiciels/RTGalgorithms.html
Chabin, J., Halfeld Ferrari, M., Musicante, M.A., Réty, P.: Minimal extensions of tree languages: Application to XML schema evolution. Technical Report RR-2009-06, LIFO (2009), http://www.univ-orleans.fr/lifo/prodsci/rapports/RR/RR2009/RR-2009-06.pdf
da Luz, R., Halfeld Ferrari, M., Musicante, M.A.: Regular expression transformations to extend regular languages (with application to a datalog XML schema validator). Journal of Algorithms (Special Issue) 62(3-4), 148–167 (2007)
Florescu, D.: Managing semi-structured data. ACM Queue 3(8), 18–24 (2005)
Garofalakis, M.N., Gionis, A., Rastogi, R., Seshadri, S., Shim, K.: Xtract: A system for extracting document type descriptors from XML documents. In: SIGMOD Conference, pp. 165–176 (2000)
Guerrini, G., Mesiti, M., Rossi, D.: Impact of XML schema evolution on valid documents. In: WIDM 2005: Proceedings of the 7th annual ACM international workshop on Web information and data management, pp. 39–44. ACM Press, New York (2005)
Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447–474 (1967)
Mani, M., Lee, D.: XML to Relational Conversion using Theory of Regular Tree Grammars. In: VLDB Workshop on EEXTT, pp. 81–103. Springer, Heidelberg (2002)
Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Trans. Inter. Tech. 5(4), 660–704 (2005)
Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of XML schema. ACM Trans. Database Syst. 31(3), 770–813 (2006)
Papakonstantinou, Y., Vianu, V.: DTD inference for views of XML data. In: PODS - Symposium on Principles of Database System, pp. 35–46. ACM Press, New York (2000)
Sakakibara, Y.: Recent advances of grammatical inference. Theor. Comput. Sci. 185(1), 15–45 (1997)
van den Brand, M., Heering, J., de Jong, H., de Jonge, M., Kuipers, T., Klint, P., Moonen, L., Olivier, P., Scheerder, J., Vinju, J., Visser, E., Visser, J.: The ASF+SDF meta-environment: a component-based language development environment. Electronic Notes in Theoretical Computer Science 44(2) (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chabin, J., Halfeld-Ferrari, M., Musicante, M.A., Réty, P. (2010). Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution. In: Cavalcanti, A., Deharbe, D., Gaudel, MC., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2010. ICTAC 2010. Lecture Notes in Computer Science, vol 6255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14808-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-14808-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14807-1
Online ISBN: 978-3-642-14808-8
eBook Packages: Computer ScienceComputer Science (R0)