Exploiting Path Information for Syntax-based XML Subtree Matching in RDBs
In this paper, we propose two methods exploiting path information, direct-parent based method and full-path based method for syntax-based XML subtree matching in RDBs. In each proposed method, we discuss two ways of using the path information. The one is utilizing the path information after matching the leaf nodes. The other is using the path information together with the PCDATA value of leaf node as the join object. We perform experiments using the real bibliography XML documents stored in RDBs to evaluate the execution time, precision and recall of subtree matching. The experimental results indicate that both the two proposed path-based methods can effectively improve the precision and recall of subtree matching comparing with the original SLAX algorithm.
Wenxin Liang Haruo Yokota
Japan Science and Technology Agency Tokyo Institute of Technology Tokyo Institute of Technology
国际会议
The Ninth International Conference on Web-Age Information Management(第九届web时代信息管理国际会议)(WAIM 2008)
张家界
英文
2008-07-20(万方平台首次上网日期,不代表论文的发表时间)