基于视图的正则路径查询重写  

Rewriting Regular Path Query Based-on Views

作　　者：高志军 

机构地区：[1]邢台金牛玻纤有限责任公司,河北邢台054000

出　　处：《自动化博览》2011年第5期94-97,共4页Automation Panorama1

摘　　要：正则路径查询的重写是实现XML查询重写优化的基础。通过比较正则路径视图和正则路径查询的结构信息,分析了两者之间进行映射应满足的条件,描述了正则路径视图到正则路径查询的映射和基于有穷自动机的映射过滤算法,并从理论上阐明了两个算法的重写等价性。借助于此两个算法,能够极大地减少需要求解的映射数目和提高正则路径查询处理的效率。As the basic module of XML query language,the rewriting of regular path query establishes the foundation of XML query rewriting and optimizing.Based on the previous researches of query answering with multiple regular path expressions,this paper analyzed the mapping conditions that should be held between regular path view and regular path query by comparing their structural information,and described the mapping algorithm between regular path view and regular path query and the finite automata-based filtering algorithm that could eliminate those redundant and illusory mappings in all candidate mappings.At the same time,theoretic analysis showed the equivalence of original query and rewritten query using two algorithms.In addition,these two algorithms can significantly cut down the number of potential mappings and speed up the processing of regular path query.

关 键 词：正则路径表达式 正则路径视图 查询重写 XML 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]