Algebra for Parallel XQuery Processing
Algebra for Parallel XQuery Processing
复制标题
DOI：
10.1007/978-3-642-33050-6_1
复制
发表时间：
2012-08
期刊：
影响因子：
--
通讯作者：
Haixu Miao;Tiezheng Nie;D. Yue;Tiancheng Zhang;Jinshen Liu
中科院分区：
文献类型：
--
作者：
Haixu Miao;Tiezheng Nie;D. Yue;Tiancheng Zhang;Jinshen Liu
随着XML成为数据表示和信息交换的标准，如何高效地从XML文档中查询信息成为热门话题。然而，对于较大的XML文档和复杂的XML文档，在单个节点上执行的查询处理的性能很难满足用户的需求。提出了一种支持XQuery语句并行处理的代数PPXA（Pure Parallel XQuery Algebra）。针对复杂路径查询和Twig查询，提出了一种基于代数的查询计划分解策略。然后，我们提出了三个基于PPXA的优化算法。逻辑并行执行计划通过操作符规则进行优化，降低了局部查询执行开销。我们在原生XML数据库系统PureXBase中实现了代数和查询分解策略。实验结果表明，该方法有效地支持了XQuery的并行查询处理，能够显著提高查询处理的效率。
As XML becomes the standard of data presentation and information exchange, how to efficiently query information from XML documents becomes a hot topic. However, for larger XML documents and complicated XQueries, the performance of query processing which executes in a single node can seldom meet the needs of users. In this paper, algebra PPXA (Pure Parallel XQuery Algebra) is proposed to support parallel processing for XQuery statements. Based on the Algebra, a strategy for query plan decomposition is proposed for complex path queries and Twig queries. Then, we propose three optimization algorithms based on PPXA. The logical parallel execution plan is optimized by rules on operators, which reduce the local query execution costs. We implement the algebra and the query decomposition strategy in a native XML database system PureXBase. The experimental results show that it supports the XQuery parallel query processing effectively, and can significantly improve the efficiency of query processing.