Abstract: In the XML query algorithm based on matching pretreatment，three important existing tree matching models are used and the matching results of data sets are presented according to the matching cost in a descending order.The function of matching pretreatment is added to improve the existing algorithm，and a series of experiments are conducted.The results show that this algorithm can remove the unwanted nodes in the tree and promote the efficiency of data sets retrieval when the data scale is very large.Especially the recall rate，the rates of accurate survey and the average response time are satisfying.This algorithm is applied in the unity retrieval system of scientific and technological resources database.It can facilitate the navigation of resources，narrow the search scope and promote the efficiency of this system.

摘要： 在基于匹配预处理的XML查询算法中，利用现有的三种树匹配模型，按照匹配代价高低得出数据集匹配结果。并在此基础上对现有算法加以改进，引入“匹配预处理”功能，进行一系列的实验。结果表明，当数据规模庞大时，该算法去除树中的无用结点，提高了数据集的查询效率，特别是查全率、查准率以及平均响应时间均令人满意。该算法应用于科技资源数据库的统一检索系统中，实现了资源导航，缩小了查找范围，提高系统的易用度。