Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
437328 | Theoretical Computer Science | 2011 | 13 Pages |
Abstract
In this paper we model schema evolution for XML by defining formal language operators on Visibly Pushdown Languages (VPLs). Our goal is to provide a framework for efficient validation of streaming XML in the realistic setting where the schemas of the exchanging parties evolve and thus diverge from one another. We show that Visibly Pushdown Languages are closed under the defined language operators and this enables us to expand the schemas (for XML) in order to account for flexible or constrained evolution.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics