A pushdown machine for recursive XML processing

Keisuke Nakano, Shin Cheng Mu

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProgramming Languages and Systems - 4th Asian Symposium, APLAS 2006, Proceedings
出版社Springer Verlag
ページ340-356
ページ数17
ISBN(印刷版)3540489371, 9783540489375
DOI
出版ステータスPublished - 2006
イベント4th Asian Symposium on Programming Languages and Systems, APLAS 2006 - Sydney, Australia
継続期間: 2006 11 82006 11 10

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4279 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other4th Asian Symposium on Programming Languages and Systems, APLAS 2006
CountryAustralia
CitySydney
Period06/11/806/11/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「A pushdown machine for recursive XML processing」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル