期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Matching algorithm for label-based integrable-ware query
1
作者 肖锟 陈世鸿 《Journal of Southeast University(English Edition)》 EI CAS 2007年第3期431-434,共4页
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 matc... 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. 展开更多
关键词 integrable-ware retrieval LABEL tree-inclusion matching
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部