节点文献

Fast Smallest Lowest Common Ancestor Computation Based on Stable Match

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 周军锋蓝国翔陈子阳汤显

【Author】 Jun-Feng Zhou 1,3 , Member, CCF, Guo-Xiang Lan 1 , Zi-Yang Chen 1 , Member, CCF and Xian Tang 2 1 School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China 2 School of Economics and Management, Yanshan University, Qinhuangdao 066004, China 3 Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Yanshan University Qinhuangdao 066004, China

【机构】 School of Information Science and Engineering, Yanshan UniversityKey Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Yanshan UniversitySchool of Economics and Management, Yanshan University

【摘要】 In this paper, we focus on efficient processing of XML keyword queries based on smallest lowest common ancestor (SLCA) semantics. For a given query Q with m Key words we propose to use stable matches as the basis for SLCA computation, where each stable match M consists of m nodes that belong to the m distinct keyword inverted lists of Q. M satisfies that no other lowest common ancestor (LCA) node of Q can be found to be located after the first node of M and be a descendant of the LCA of M, based on which the operation of locating a stable match can skip more useless nodes. We propose two stable match based algorithms for SLCA computation, i.e., BSLCA and HSLCA. BSLCA processes two keyword inverted lists each time from the shortest to the longest, while HSLCA processes all keyword inverted lists in a holistic way to avoid the problem of redundant computation invoked by BSLCA. Our extensive experimental results verify the performance advantages of our methods according to various evaluation metrics.

【Abstract】 In this paper, we focus on efficient processing of XML keyword queries based on smallest lowest common ancestor (SLCA) semantics. For a given query Q with m Key words we propose to use stable matches as the basis for SLCA computation, where each stable match M consists of m nodes that belong to the m distinct keyword inverted lists of Q. M satisfies that no other lowest common ancestor (LCA) node of Q can be found to be located after the first node of M and be a descendant of the LCA of M, based on which the operation of locating a stable match can skip more useless nodes. We propose two stable match based algorithms for SLCA computation, i.e., BSLCA and HSLCA. BSLCA processes two keyword inverted lists each time from the shortest to the longest, while HSLCA processes all keyword inverted lists in a holistic way to avoid the problem of redundant computation invoked by BSLCA. Our extensive experimental results verify the performance advantages of our methods according to various evaluation metrics.

【基金】 partially supported by the National Natural Science Foundation of China under Grant Nos. 61073060, 61040023,61272124;the Science and Technology Research and Development Program of Hebei Province of China under Grant No. 11213578
  • 【文献出处】 Journal of Computer Science & Technology ,计算机科学技术学报(英文版) , 编辑部邮箱 ,2013年02期
  • 【分类号】TP391.3
  • 【下载频次】29
节点文献中: 

本文链接的文献网络图示:

本文的引文网络