Binary Comparative Search for SLCA Problem
Nowadays, searching information exactly from XML data has become more and more important . SLCA (smallest lowest common ancestors ) is a method of getting information from XML data. The method is that we are requested to find all the nodes corresponding to the tightest subtrees in XML data, which involves the given keywords. Its a convenient method to retrieve data from XML documents for searcher ,especially who is not familiar with XML knowledge. There have been many proposed algorithms solving SLCA problem through transforming XML documents into XML trees labeled with Dewey codes, such as LISA and LISA II .This paper proposes a new solution, Binary Comparative Search (BCS), targeted to XML data retrieval. Compared with LISA II, which has been proven to be better than ILE and SE. The new method dose more efficiently. In the end , LISA II and BCS are tested analytically and experimentally on data generated by XMark.
ZANG Shao-yu HONG Xiao-guang LIU Lei
School of Computer Science and Technology, Shandong University, 250100, China
国际会议
2009 IEEE International Symposium on IT in Medicine & Education( IEEE 教育与医药信息化国际会议)
济南
英文
1214-1217
2009-08-14（万方平台首次上网日期，不代表论文的发表时间）