Efficient keyword search for SLCA in parallel XML databases
Keyword search is a wildly popular way for querying XML document. However, the increasing volume of XML data poses new challenges to keyword search processing. Parallel database is an efficient solution for this problem. In this paper, we study the problem of effective keyword search for SLCA (Smallest lower common ancestor) in parallel XML databases. We propose two efficient algorithm SONB (Scan once with no buffer) and MSOP (Merge strategy based on ordered partition) to compute the SLCA efficiently in the parallel environment. We have performed an extensive experimental study and the results show that our proposed approach achieves high efficiency for the keyword search.
keyword search XML parallel SLCA
Dejun Yue Ge Yu Jinshen Liu Tiancheng Zhang Tiezheng Nie FangFang li
Department of Computer Software and Theory School of information science and engineering, Northeastern University Shenyang, China
国际会议
重庆
英文
29-34
2011-10-21（万方平台首次上网日期，不代表论文的发表时间）