An Efficient Algorithm for XML Keyword Search Based on Interval Encoding

摘要：

　　Recently, keyword search on XML data has received much attention.Existing XML keyword search algorithms are all based on Dewey labeling, and this method in the calculation of the common ancestor would suffer from the CAR (common-ancestor-repetition) problem.In this paper, we propose a novel index based on interval encoding, namely IS-Index.We then design an efficient algorithm based on this structure, namely Interval-Search algorithm.Firstly, the algorithm calculates the minimum common ancestors by the range value between nodes that contain keywords.Then it traverses the IS-Index and computes common ancestor nodes to get the candidate SLCAs.Finally, it filters the candidate SLCAs to get SLCA nodes.The experimental results show that our method is an efficient algorithm for finding SLCA nodes.

关键词： XML Keyword Search SLCA Interval Encoding Interval-Search

作者: HAO Kun ZHANG Xiaolin LIU Lixin ZHANG Huanxiang

作者单位: School of Information Engineering, Inner Mongolia University of Science and Technology Baotou, China

会议类型: 国际会议

会议名称: The 13th Web Information Systems and Applications Conference(第十三届全国web信息系统及其应用学术会议)(WISA2016)、The 1st Symposium on Big Data Processing and Analysis)( BDPA 2016)第一届全国大数据处理与分析学术研讨会、The 1st Workshop on Information System Security)(ISS2016)(第一届全国信息系统安全研讨会

会议地点: 武汉

会议语种:英文

页码: 45-50

在线出版日期: 2016-09-23（万方平台首次上网日期，不代表论文的发表时间）