标题:XML-twig approximate matching twig join algorithm based on DTD
作者:Liu, Zhongyan ;Hong, Xiaoguang ;Hu, Ye
通讯作者:Hong, X
作者机构:[Liu, Zhongyan ;Hong, Xiaoguang ;Hu, Ye ] Department of Computer Science and Technology, Shandong University, Jinan, Shandong, 250101, China
会议名称:2010 2nd International Conference on Industrial and Information Systems, IIS 2010
会议日期:10 July 2010 through 11 July 2010
来源:2010 2nd International Conference on Industrial and Information Systems, IIS 2010
出版年:2010
卷:2
页码:226-229
DOI:10.1109/INDUSIS.2010.5565637
关键词:Approximate matching; DTD; FTJ; Twig join
摘要:Recently, the majority of twig join algorithms have been proposed are based on matching querying given by the user strictly. That is to say, matching with high accuracy between the query and the data specified For some simple queries, such as the queries only containing target path, though the user's final purpose is clear, the middle path may be ambiguous. Such kind of target path query which doesn't contain branches can be implemented by the twig join algorithm which has already been proposed, such as PackStack, TwigStack, TJFast. However, if the user expressed the middle path of the twig query ambiguously, the results of the above join algorithms would be empty. Therefore, strict matching algorithms are not always perfect In this paper, we propose XML-twig target path approximate matching twig join algorithm based on DTD named FTJ, which can realize flexible matching. It does not only meets the strict matching, but also satisfies the query needs with clear query target when the user doesn't understand the pattern information of the DTD. © 2010 IEEE.
收录类别:EI;SCOPUS
Scopus被引频次:1
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-77958509980&doi=10.1109%2fINDUSIS.2010.5565637&partnerID=40&md5=ac966463c6ea352f4317053bb9d496eb
TOP