【摘要】 路径表达式的最小化问题,是快速有效地从XML数据源中查询所需信息的重要因素。为了加速路径表达式的处理,在深入分析Chase方法的基础上,提出一种基于匹配的最小化策略。该方法利用了匹配的基本操作来删除冗余分支以便达到优化的目的,在匹配的过程中,按照自上而下的顺序对树中的结点对进行匹配来减少计算的工作量。初步的分析表明,该方法比普遍意义上的消除路径表达式的冗余条件的方法更能有效地提高查询效率。更多还原

【Abstract】 At present,aiming at the miniature of path expression,it becomes the key research on how to query necessary information rapidly and efficiently from the XML data.A matched strategy is proposed in order to accelerate XML data processing based on analyzing the chase approach.This approach makes use of the matched basic operations to scissor redundant embranchments.In the procedure of matching rations,the matched sequence from top to down reduces a lot of computational operations.Analysis shows the method is even more effectively than others.更多还原