On the Minimization of XML-Schemas and Tree Automata for Unranked Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2007

On the Minimization of XML-Schemas and Tree Automata for Unranked Trees

Abstract

Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unranked tree automata that are standard in database theory, assuming bottom-up determinism and that horizontal recursion is represented by deterministic finite automata. We show that minimal automata in that class are not unique and that minimization is np complete. Second, we study more recent automata classes that do allow for polynomial time minimization. Among those, we show that bottom-up deterministic stepwise tree automata yield the most succinct representations. Third, we investigate abstractions of ML schema languages. In particular, we show that the class of one-pass preorder typable schemas allows for polynomial time minimization and unique minimal models.
Fichier principal
Vignette du fichier
mini.pdf (426.97 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00088406 , version 1 (01-08-2006)
inria-00088406 , version 2 (13-08-2006)

Identifiers

Cite

Wim Martens, Joachim Niehren. On the Minimization of XML-Schemas and Tree Automata for Unranked Trees. Journal of Computer and System Sciences, 2007, Journal of Computer and System Science, 73 (4), pp.550-583. ⟨10.1016/j.jcss.2006.10.021⟩. ⟨inria-00088406v2⟩
205 View
318 Download

Altmetric

Share

Gmail Facebook X LinkedIn More