Which XML Schemas are Streaming Bounded ...
Document type :
Article dans une revue scientifique: Article original
Title :
Which XML Schemas are Streaming Bounded Repairable?
Author(s) :
Bourhis, Pierre [Auteur]
Linking Dynamic Data [LINKS]
Puppis, Gabriele [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Riveros, Cristian [Auteur]
Pontificia Universidad Católica de Chile [UC]

Linking Dynamic Data [LINKS]
Puppis, Gabriele [Auteur]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Riveros, Cristian [Auteur]
Pontificia Universidad Católica de Chile [UC]
Journal title :
Theory of Computing Systems
Publisher :
Springer Verlag
Publication date :
2015
ISSN :
1432-4350
HAL domain(s) :
Informatique [cs]
Informatique [cs]/Base de données [cs.DB]
Informatique [cs]/Base de données [cs.DB]
English abstract : [en]
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 ...
Show more >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 automatonShow less >
Show more >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 automatonShow less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-01211290/document
- Open access
- Access the document
- http://www.labri.fr/perso/gpuppis/articles/TOCS%202015b.pdf
- Open access
- Access the document
- https://hal.inria.fr/hal-01211290/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01211290/document
- Open access
- Access the document
- document
- Open access
- Access the document
- TOCS%202015b.pdf
- Open access
- Access the document
- TOCS%202015b.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- TOCS%202015b.pdf
- Open access
- Access the document