| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Outline of Final Research Achievements |
History-pattern encoding we are proposing is an efficient encoding scheme for dynamically increasing multidimensional tuple datasets. In this research, based on the encoding scheme, (i) a new implementation scheme was presented for dynamically growing large scale tree graph, (ii) a prototype system for storing and retrieving tree structures underlying in XML documents was constructed and evaluated. The following four achievements were accomplished: (1) The problems arising in encoding the labeled tree graphs were clarified in using the history-pattern encoding scheme. (2) To resolve these problems, a tree graph partitioning scheme was presented and implemented. (3) To support the distribution and integration of the large scale tree graphs, an embedding scheme of the guest tree graphs in a single host tree graph was designed. (4) In order to apply the embedding scheme in (3) to the distributed XML documents processing system, the scheme was adapted to the distributed environment.
|
