基于数据关系表的XML查询算法  

A XML query method based on data relation table

作　　者：吴清怡[1] 马良荔[1] 孙煜飞[1] 

机构地区：[1]海军工程大学,湖北武汉430033

出　　处：《辽宁工程技术大学学报（自然科学版）》2013年第1期68-72,共5页Journal of Liaoning Technical University (Natural Science)

摘　　要：为解决交互式电子技术手册数据量庞大、结构繁杂不易查询的问题,采用将XML文档分解为层次化数据关系表的设计方法.在系统中创建数据结点,提取后构成文档树;根据文中定义将整体数据分解为具有层次化的数据关系表片段,由约束条件忽略与其明显不符片段及其附属,简化数据关系表;在简化数据关系表中搜索查询结点,根据算法进行计算,确定所查结点在文档树中具体位置及路径;依据所得位置及路径在系统中有针对性、目标性的查询.结果表明:该方法能够有效减少XML文档查询数据的路径,实现查询的高效性.In an interactive technical electronic manual, the quantity of its data is huge, and its data structure is complicated. Thus it is difficult to be queried. This study proposes a new method that decomposes a XML document into a hierarchical data relation table. Firstly, various data nodes are created in the system which will form document tree after extraction. Secondly, according to the definition, the whole data are decomposed into hierarchical data table fragments, ignoring the fragments that differ markedly from the data and their subsidiaries by the constraints, and the data relation table is simplified. Thirdly, the nodes in the simplified data table are searched, and calculated according to the algorithm developed to determine the location and path of the node in the document tree. Finally the query is made based on the location and path with the target. As a result, the method reduces the paths when querying XML-document data, and achieves an effective query.

关 键 词：IETM XML 查询 数据关系表 层次化 文档树 单元树 二维数组 单元矩阵 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]