Improving the performance of identifying contributors for XML keyword search

  • Authors:

  • Rung-Ren Lin;Ya-Hui Chang;Kun-Mao Chao

  • Affiliations:

  • National Taiwan University, Taipei, Taiwan;National Taiwan Ocean University, Keelung, Taiwan;National Taiwan University, Taipei, Taiwan

  • Venue:
  • ACM SIGMOD Record
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Keyword search is a friendly mechanism for users to identify desired information in XML databases, and LCA is a popular concept for locating the meaningful subtrees corresponding to query keywords. Among all the LCA-based approaches, MaxMatch [9] is the only one which could achieve the property of monotonicity and consistency, by outputting only contributors instead of the whole subtree. Although the MaxMatch algorithm performs efficiently in some cases, there is still room for improvement. In this paper, we first propose to improve its performance by avoiding unnecessary index accesses. We then speed up the process of subset detection, which is a core procedure for determining contributors. The resultant algorithm is called MinMap and MinMap+, respectively. At last, we analytically and empirically demonstrate the efficiency of our methods. According to our experiments, our two algorithms work better than the existing one, and MinMap+ is particularly helpful when the breadth of the tree is large and the number of keywords grows.