XML数据的路径表达式查询优化技术  

Optimizing Path Expression Queries of XML Data

作　　者：吕建华[1] 王国仁[1] 于戈[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《软件学报》2003年第9期1615-1620,共6页Journal of Software

基　　金：国家自然科学基金;教育部高等学校优秀青年教师教学和科研奖励基金;教育部高等学校骨干教师资助计划~~

摘　　要：路径表达式作为XML数据查询语言的核心部分,关于它的计算方法的研究成果已有很多,然而针对路径表达式本身进行优化的研究却相对较少.提出了两种针对路径表达式的优化策略:路径缩短策略和补路径策略,从而提高了XML路径查询效率.路径缩短策略根据XML文档模式信息,将路径表达式查询长度缩短,从而简化查询本身以降低需要的查询代价;而补路径策略则试图使用代价更小的等价路径表达式来替换原始查询.经过对实验数据的分析,这两种优化策略对于绝大多数路径表达式查询可以应用,并可大幅度地改进路径表达式的查询性能.Path expression is one of the core components of most XML query languages, and many evaluation methods for path expression queries are proposed recently. However, there are few researches on the issue of path expression optimization. Two kinds of path expression optimizing principles are proposed, named path shorten and path complementing, respectively. The path shorten principle reduces the querying cost by shortening the path expressions with the knowledge of XML schema. While the path complementing principle tends to substitute the user queries with the equivalent lower-cost path expressions. The experimental results show that these two techniques can work on most path expression queries and largely improve the efficiency of path expression query processing.

关 键 词：XML 路径表达式 查询处理 查询代价 查询优化 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]