ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 学術雑誌論文

Dividing Huge XML Trees Using the m-bridge Technique over One-to-one Corresponding Binary Trees

http://hdl.handle.net/10173/1451
http://hdl.handle.net/10173/1451
12699a00-2ef0-442a-aee9-ed128f79d55a
名前 / ファイル ライセンス アクション
28-56.pdf 28-56.pdf (481.0 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2017-03-24
タイトル
タイトル Dividing Huge XML Trees Using the m-bridge Technique over One-to-one Corresponding Binary Trees
言語
言語 eng
キーワード
主題Scheme Other
主題 XML
キーワード
主題Scheme Other
主題 distributed computing
キーワード
主題Scheme Other
主題 data division
キーワード
主題Scheme Other
主題 binary-tree representation
キーワード
主題Scheme Other
主題 SAX
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者 Kawamura, Takayuki

× Kawamura, Takayuki

Kawamura, Takayuki

Search repository
Matsuzaki, Kiminori

× Matsuzaki, Kiminori

Matsuzaki, Kiminori

Search repository
抄録
内容記述タイプ Abstract
内容記述 Tree data such as XML trees have recently been getting larger and larger. Parallel and distributed processing is a promising way of dealing with big data, but we need to divide the data in the first step. Since computation over trees often requires relationships between parents and children and/or among siblings, we should pay attention to such relationships. There is a technique called the “m-bridge” for dividing trees. We can easily compute m-bridges for trees of any shape. However, division with the m-bridge technique is sometimes unsatisfactory for shallow XML trees. We propose a method of tree division for XML trees in this study, in which we apply the m-bridge technique to a one-to-one corresponding binary tree. We implement the tree division algorithm using the Simple API for XML (SAX) Parser. An important feature of our algorithm is that we transform and divide XML trees in the order that the SAX parser reads the trees. We carried out experiments and discuss the properties of the tree division algorithm we propose. In addition, we discuss how we can use the divided trees with query examples.
書誌情報 IPSJ Transaction on Programming

巻 7, 号 3, p. 40-50, 発行日 2014-07
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7802
権利
権利情報 Copyright © 2014 by the Information Processing Society of Japan
著者版フラグ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
出版者
出版者 Information Processing Society of Japan (情報処理学会)
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 13:39:53.525258
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3