部分木検索のための走査と結果構築コストを考慮したXML分割配置と位置情報取得手法

悠二 吉野, Yuuji Yoshino, 文新 梁 et al. · Institutional Repositories DataBase (IRDB) · 2008

Recently, large-scale XML data are often retrieved in the unit of subtrees instead of nodes.To achieve efficient transversal and result construction of the XML data stored in distributed RDB systems, it is important to balance the processing costs among DBMSs.In this paper, we propose a method to balance the costs of processing distributed large XML data.First, we fragment an XML document into subtrees representing the same or similar meaningful unit.Next, we cluster the fragmented subtrees based on the strings of specific nodes.And we allocate the clusters in distributed RDBs based on the costs calculated with the size and the number of nodes in each subtree.We also propose an index structure to achieve efficient data access.We perform experiments to evaluate the effectiveness of the proposed method using the XML data of English Wikipedia stored in multiple PostgreSQL servers.

Cited by 0 works. Open-access PDF

Authors