WEKO3
アイテム
A Partial-tree-based Approach for XPath Query on Large XML Trees
https://ipsj.ixsq.nii.ac.jp/records/157624
https://ipsj.ixsq.nii.ac.jp/records/15762486c07513-4d24-4f48-9a15-4702aae2b6d4
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TPRO0901004.pdf (962.5 kB)
|
Copyright (c) 2016 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-02-26 | |||||||||
| タイトル | ||||||||||
| タイトル | A Partial-tree-based Approach for XPath Query on Large XML Trees | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | A Partial-tree-based Approach for XPath Query on Large XML Trees | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [通常論文] XML, XPath, XML query, parallel programming, partial tree | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| School of Information, Kochi University of Technology / Department of Computer Science and Engineering, Anhui University of Science and Technology | ||||||||||
| 著者所属 | ||||||||||
| School of Information, Kochi University of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| School of Information, Kochi University of Technology / Department of Computer Science and Engineering, Anhui University of Science and Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| School of Information, Kochi University of Technology | ||||||||||
| 著者名 |
Wei, Hao
× Wei, Hao
× Kiminori, Matsuzaki
|
|||||||||
| 著者名(英) |
Wei, Hao
× Wei, Hao
× Kiminori, Matsuzaki
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | XML is a popular data definition language and is widely used for representation of arbitrary data structures. For queries on XML documents, XPath has commonly been used in many applications. The complexity of applying queries increases as the number of nodes in an XML document increases. Querying very large XML documents becomes really difficult when there is not enough computer memory to store and manipulate the whole tree data. The objective of this study is to develop an algorithm for querying very large XML trees in a distributed-memory environment. We split a large XML document into small chunks and parse the chunks to create special trees called partial trees. Then the query is executed in parallel on the partial trees. The results from the partial trees are concatenated to form the final query results for output. The algorithms were tested on a 16-node PC cluster, and the experiment results showed a speedup of a factor of 6 on 16 nodes. \n------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.2(online) ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | XML is a popular data definition language and is widely used for representation of arbitrary data structures. For queries on XML documents, XPath has commonly been used in many applications. The complexity of applying queries increases as the number of nodes in an XML document increases. Querying very large XML documents becomes really difficult when there is not enough computer memory to store and manipulate the whole tree data. The objective of this study is to develop an algorithm for querying very large XML trees in a distributed-memory environment. We split a large XML document into small chunks and parse the chunks to create special trees called partial trees. Then the query is executed in parallel on the partial trees. The results from the partial trees are concatenated to form the final query results for output. The algorithms were tested on a 16-node PC cluster, and the experiment results showed a speedup of a factor of 6 on 16 nodes. \n------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.24(2016) No.2(online) ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AA11464814 | |||||||||
| 書誌情報 |
情報処理学会論文誌プログラミング（PRO） 巻 9, 号 1, 発行日 2016-02-26 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7802 | |||||||||
| 出版者 | ||||||||||
| 言語 | ja | |||||||||
| 出版者 | 情報処理学会 | |||||||||
