DocumentCode :
2617638
Title :
XSLT streamability analysis with recursive schemas
Author :
Labath, Pavel
Author_Institution :
Dept. of Comput. Sci., Comenius Univ., Bratislava, Slovakia
fYear :
2012
fDate :
16-18 May 2012
Firstpage :
1
Lastpage :
6
Abstract :
We present an algorithm which checks whether a restricted XSLT stylesheet can be applied to documents conforming to a given schema using the Simple Streaming XML Transducer algorithm of Dvořáková et al. [1], [2]. Our contribution consists in extending the set of admissible schemas by allowing the choice constructor and recursive element definitions. We thoroughly analyze every part of the algorithm, prove its correctness and determine the worst case complexity bounds.
Keywords :
XML; computational complexity; document handling; graph theory; XSLT streamability analysis; admissible schema set extension; choice constructor; extensible stylesheet language transformation; recursive element definitions; recursive schemas; restricted XSLT stylesheet; simple streaming XML transducer algorithm; worst case complexity bounds; Algorithm design and analysis; Automata; Complexity theory; Grammar; Learning automata; Testing; XML;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Research Challenges in Information Science (RCIS), 2012 Sixth International Conference on
Conference_Location :
Valencia
ISSN :
2151-1349
Print_ISBN :
978-1-4577-1936-3
Electronic_ISBN :
2151-1349
Type :
conf
DOI :
10.1109/RCIS.2012.6240419
Filename :
6240419
Link To Document :
بازگشت