-
- Li Bei
- Graduate School of Engineering, University of Fukui
-
- Kawaguchi Katsuya
- Toshiba Solutions Corporation
-
- Tsuji Tatsuo
- Graduate School of Engineering, University of Fukui
-
- Higuchi Ken
- Graduate School of Engineering, University of Fukui
抄録
This paper presents a novel labeling scheme for dynamic XML trees. The scheme employs history-offset encoding method for multidimensional datasets and takes advantage of this method by embedding an XML tree into a multidimensional extendible array. Even if structural updates are made on the XML tree, no relabeling of nodes is required under the support of extra data structure for preserving the document order. The most significant advantage of our scheme over other existing labeling schemes is that the storage cost for generated labels is very small irrespective of the order and the position of node insertions; in most of our competing schemes, the generated label size would become very large if the insertions occur around the same position. After describing our labeling scheme, label size, total label storage cost and node access performance are examined compared with other sophisticated schemes, such as ORDPATH, QED, DLN and Prime Numbering, and proves that our scheme outperforms these schemes in some criteria.
収録刊行物
-
- IPSJ Online Transactions
-
IPSJ Online Transactions 3 71-87, 2010
一般社団法人 情報処理学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390001205293987200
-
- NII論文ID
- 130000251590
-
- ISSN
- 18826660
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可