WEKO3
アイテム
Ordered Types for Stream Processing of Tree-Structured Data
https://ipsj.ixsq.nii.ac.jp/records/72843
https://ipsj.ixsq.nii.ac.jp/records/728438d3437bc-4c91-4141-9836-1b4cb8899434
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2011 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | Journal(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2011-02-15 | |||||||
タイトル | ||||||||
タイトル | Ordered Types for Stream Processing of Tree-Structured Data | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | Ordered Types for Stream Processing of Tree-Structured Data | |||||||
言語 | ||||||||
言語 | eng | |||||||
キーワード | ||||||||
主題Scheme | Other | |||||||
主題 | 一般論文 | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
資源タイプ | journal article | |||||||
著者所属 | ||||||||
Tohoku University | ||||||||
著者所属 | ||||||||
Tohoku University | ||||||||
著者所属 | ||||||||
Tohoku University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Tohoku University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Tohoku University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Tohoku University | ||||||||
著者名 |
Ryosuke, Sato
× Ryosuke, Sato
|
|||||||
著者名(英) |
Ryosuke, Sato
× Ryosuke, Sato
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Suenaga, et al. have developed a type-based framework for automatically translating tree-processing programs into stream-processing ones. The key ingredient of the framework was the use of ordered linear types to guarantee that a tree-processing program traverses an input tree just once in the depth-first, left-to-right order (so that the input tree can be read from a stream). Their translation, however, sometimes introduces redundant buffering of input data. This paper extends their framework by introducing ordered, non-linear types in addition to ordered linear types. The resulting transformation framework reduces the redundant buffering, generating more efficient stream-processing programs. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | Suenaga, et al. have developed a type-based framework for automatically translating tree-processing programs into stream-processing ones. The key ingredient of the framework was the use of ordered linear types to guarantee that a tree-processing program traverses an input tree just once in the depth-first, left-to-right order (so that the input tree can be read from a stream). Their translation, however, sometimes introduces redundant buffering of input data. This paper extends their framework by introducing ordered, non-linear types in addition to ordered linear types. The resulting transformation framework reduces the redundant buffering, generating more efficient stream-processing programs. | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AN00116647 | |||||||
書誌情報 |
情報処理学会論文誌 巻 52, 号 2, p. 766-779, 発行日 2011-02-15 |
|||||||
ISSN | ||||||||
収録物識別子タイプ | ISSN | |||||||
収録物識別子 | 1882-7764 |