The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW) (2006)
Atlanta, Georgia
Apr. 3, 2006 to Apr. 7, 2006
ISBN: 0-7695-2571-7
pp: x114
Kentarou Kido , University of Tsukuba, Japan
Toshiyuki Amagasa , University of Tsukuba, Japan
Hiroyuki Kitagawa , University of Tsukuba, Japan
Recently, with the rapid spread of XML format, it has become popular that large-scale data, whose size range from several hundreds of MB to several GB, are described by XML. For the purpose of providing fast and reliable means for storage and retrieval of huge XML data, it is a reasonable choice for us to use XML databases. In fact, there are many ways to realize XML databases, but relational XML database, in that an XML data is mapped to relational tables and query processing is enabled in terms of SQL queries, is one of the most popular way to implement XML databases. However, some researchers have pointed out that the performance of relational XML databases degrades when dealing with such huge XML data. In this study, we propose a scheme for parallel processing of XML data using PC Clusters. First, we discuss how to decompose XML data so that we can perform parallel processing of XML queries. We give the definitions of vertical and horizontal decomposition of XML data based on decomposition of schema graph and XML instances, respectively. To allocate decomposed XML data to cluster nodes, we give an algorithm for computing pseudo-optimal assignment of XML fragments like greedy method in the light of XML query workload. Finally, we experimentally evaluate the effectiveness of the proposed method.
Kentarou Kido, Toshiyuki Amagasa, Hiroyuki Kitagawa, "Processing XPath Queries in PC-Clusters Using XML Data Partitioning", 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), vol. 00, no. , pp. x114, 2006, doi:10.1109/ICDEW.2006.120
92 ms
(Ver 3.3 (11022016))