摘要
为实现XML关键字查询,提出一种基于扩展Dewey编码快速求解SLCA的新算法:FEDA.算法利用Dewey扩展编码快速命中含有N个关键字的集合,将最终交集看做一棵简化的XML树,所有的叶节点即为求解的SLCA.该算法与经典的ILE算法进行对比,效率优于ILE算法.
For XML query keywords, a new algorithm FEDA based on extended Dewey encoding for fast solving SLCA is proposed. The algorithm gets a collection of N key words quickly by extended Dewey encoding,and the final intersection can be as a simplified XML tree, and the solution to SLCA is all of the leaf nodes. Compared with the classical ILE algorithm, the experimental results showed that the FEDA efficiency was better than the ILE algorithm.
出处
《海南师范大学学报(自然科学版)》
CAS
2015年第4期381-384,共4页
Journal of Hainan Normal University(Natural Science)
基金
安徽省高校自然科学研究一般项目(113052015KJ09)
蚌埠学院自然科学项目(2013ZR06)
安徽电子信息职业技术学院自然科学项目(ADZX1303)
关键词
XML文档
扩展编码
Dewey
SLCA
XML document
Dewey
Extended encoding
SLCA