Evolving schemas for streaming XML

被引：5
作者：
Shoaran, M. [1 ]
Thomo, A. [1 ]
机构：
[1] Univ Victoria, Victoria, BC, Canada
来源：
THEORETICAL COMPUTER SCIENCE | 2011年 / 412卷 / 35期
关键词：
XML schemas; Evolution; Streaming data; Visibly pushdown languages;
D O I：
10.1016/j.tcs.2011.04.037
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：4545 / 4557
页数：13
相关论文
共 29 条
  • [1] Alur R., 2004, P 36 ANN ACM S THEOR, P202, DOI [DOI 10.1145/1007352.1007390, 10.1145/1007352.1007390]
  • [2] FIRST-ORDER AND TEMPORAL LOGICS FOR NESTED WORDS
    Alur, Rajeev
    Arenas, Marcelo
    Barcelo, Pablo
    Etessami, Kousha
    Immerman, Neil
    Libkin, Leonid
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (04)
  • [3] Alur Rajeev., 2007, Symp. on Principles of Database Systems, P233, DOI DOI 10.1145/1265530.1265564
  • [4] Arenas M, 2007, LECT NOTES COMPUT SC, V4596, P888
  • [5] Benedikt M, 2007, LECT NOTES COMPUT SC, V4855, P461
  • [6] Boobna U, 2004, LECT NOTES COMPUT SC, V3186, P97
  • [7] Clark J., 2001, RELAX NG SPECIFICATI
  • [8] Comon H., 2008, Tree Automata Techniques and Applications
  • [9] Closure and decidability properties of some language classes with respect to ciliate bio-operations
    Daley, M
    Ibarra, OH
    Kari, L
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 19 - 38
  • [10] Flesca S, 2005, LECT NOTES COMPUT SC, V3806, P175
123