Name
Abstract | ||
|---|---|---|
XML transformations are most naturally defined as recursive functions on trees. A naive implementation, however, would load the entire input XML tree into memory before processing. In contrast, programs in stream processing style minimise memory usage since it may release the memory occupied by the processed prefix of the input, but they are harder to write because the programmer is left with the burden to maintain a state. In this paper, we propose a model for XML stream processing and show that all programs written in a particular style of recursive functions on XML trees, the macro forest transducer, can be automatically translated to our stream processors. The stream processor is declarative in style, but can be implemented efficiently by a pushdown machine. We thus get the best of both worlds — program clarity, and efficiency in execution. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11924661_21 | APLAS |
Keywords | Field | DocType |
macro forest transducer,entire input xml tree,recursive xml processing,stream processing style minimise,memory usage,xml tree,recursive function,xml stream processing,stream processor,pushdown machine,xml transformation,particular style,stream processing | XML framework,Programming language,XML,Computer science,XML validation,Theoretical computer science,XML tree,XML schema,Tree automaton,Stream processing,Recursion | Conference |
Volume | ISSN | ISBN |
4279 | 0302-9743 | 3-540-48937-1 |
Citations | PageRank | References |
9 | 0.57 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Keisuke Nakano | 1 | 212 | 24.62 |
| Shin-cheng Mu | 2 | 216 | 19.02 |