Based on tree-inclusion matching, retrieval may be transformed into matching between the query tree and the integrable-ware label tree. Considering the retrieval specialities of integrable-ware, three theorems of matching are given. On this basis, the inverted-path string algorithm for the integrable-ware label tree query is proposed. This algorithm searches from leaf nodes rather than from root nodes, and considers about the path length and the total number of leaf nodes. It can terminate the failed matching as early as possible and avoid spending too much time on loop comparisons in character string matching. It utilizes the dictionary suffix order to skip much of the impossibility matching path. The experimental results show that this algorithm enhances the recall and the precision of integrable-ware query efficiency while maintaining the searching speed of the integrable-ware.
