Which XML Schemas are Streaming Bounded Repairable? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theory of Computing Systems Year : 2015

Which XML Schemas are Streaming Bounded Repairable?


In this paper we consider the problem of repairing, that is, restoring validity of, documents with respect to XML schemas. We formalize this as the problem of determining, given an XML schema, whether or not a streaming procedure exists that transforms an input document so as to satisfy the XML schema, using a number of edits independent of the document. We show that this problem is decidable. In fact, we show the decidability of a more general problem, which allows the repair procedure to work on documents that are already known to satisfy another XML schema. The decision procedure relies on the analysis of the structure of an automaton model specifying the restriction and target XML schemas and reduces te problem to a novel notion of game played on pushdown systems associated with the schemas. Keywords bounded repair ⋅ streaming repair ⋅ DTD ⋅ XML Schema ⋅ top-down deterministic tree automaton
Fichier principal
Vignette du fichier
TOCS 2015b.pdf (689.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01211290 , version 1 (04-10-2015)



Pierre Bourhis, Gabriele Puppis, Cristian Riveros. Which XML Schemas are Streaming Bounded Repairable?. Theory of Computing Systems, 2015, ⟨10.1007/s00224-015-9611-y⟩. ⟨hal-01211290⟩
135 View
86 Download



Gmail Facebook Twitter LinkedIn More