Effective Keyword Search for Candidate Fragments of XML Documents

摘要

In this paper, we focus on the problem of effectively and efficiently answering XML keyword search. We first show the weakness of existing SLCA (Smallest Lowest Common Ancestor) based solutions, and then we propose the concept of Candidate Fragment. A Candidate Fragment is a meaningful sub tree in the XML document tree, which has the appropriate granularity. To efficiently compute Candidate Fragments as the answers of XML keyword search, we design Node Match Algorithm and Path Match algorithm. Finally, we conduct extensive experiments to show that our approach is both effective and efficient.