DOI: 10.1007/978-3-540-85257-5_10
|View full text |Cite
|
Sign up to set email alerts
|

Xord: An Implementation Framework for Efficient XSLT Processing

Abstract: Summary. We introduce an implementation of Xord -an XSLT processing framework which enables us to design and implement efficient algorithms for clearly characterized classes of XSLT transformations with known memory requirements. Within the framework, we design and implement a streaming algorithm using stack of the size proportional to the depth of the input document and associate it with the class of simple order-preserving and branch-disjoint transformations. The framework provides an unified interface to th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 6 publications
0
7
0
Order By: Relevance
“…The transformer takes two inputs: an XSLT stylesheet xsl, and an XML document xml valid with respect to xsd. It is based on the non-buffering SSXT streaming algorithm [5] which is extended by a possibility to store parts of the input temporarily in memory buffers. The decisions on when to start buffering and when to process buffer content are taken according to the information stored in the fragments.…”
Section: Buxt Engine Overviewmentioning
confidence: 99%
See 3 more Smart Citations
“…The transformer takes two inputs: an XSLT stylesheet xsl, and an XML document xml valid with respect to xsd. It is based on the non-buffering SSXT streaming algorithm [5] which is extended by a possibility to store parts of the input temporarily in memory buffers. The decisions on when to start buffering and when to process buffer content are taken according to the information stored in the fragments.…”
Section: Buxt Engine Overviewmentioning
confidence: 99%
“…In case a final state appears in the new sequence, the transformer checks whether buffering is needed by examining all fragment items (6). If some of them contains start-of-buffer node for 5 Note that call1 may be the beginning of the template and call2 may be the end of the template. the current context, a new buffer is filled with the content of the current tag.…”
Section: Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…They however do not tackle the problem of efficiently performing the transformation. A second trend of related researches looks for an efficient model for performing XML transformations [DZ09,DZ08,FN07]. Clearly, first and foremost we would have to assess the exact expressiveness of macro VPT with regards to all those existing models.…”
Section: Future Workmentioning
confidence: 99%