Abstract:
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...Show MoreMetadata
Abstract:
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.
Date of Conference: 20-22 July 2008
Date Added to IEEE Xplore: 12 August 2008
CD:978-0-7695-3185-4