位图过滤:一种有效的XML结构匹配加速方法

F. Shao, Gang Chen, Lihua Yu, Yijun Bei, Jinxiang Dong
{"title":"位图过滤:一种有效的XML结构匹配加速方法","authors":"F. Shao, Gang Chen, Lihua Yu, Yijun Bei, Jinxiang Dong","doi":"10.1109/SNPD.2007.376","DOIUrl":null,"url":null,"abstract":"With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Bitmap Filtering: An Efficient Speedup Method for XML Structural Matching\",\"authors\":\"F. Shao, Gang Chen, Lihua Yu, Yijun Bei, Jinxiang Dong\",\"doi\":\"10.1109/SNPD.2007.376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching.\",\"PeriodicalId\":197058,\"journal\":{\"name\":\"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2007.376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2007.376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

随着internet上XML数据的激增,对高效的XML结构匹配技术提出了很大的需求。提出了一种基于后缀位图和前缀位图的辅助过滤方法,以加快XML结构匹配的速度。对于XML文档中的每个节点,后缀位图分别以压缩格式捕获后缀子树的标记名称列表,前缀位图捕获前缀路径的标记名称列表。在结构匹配过程中,通过比较各自的位图,可以有效地过滤掉大部分不匹配的候选节点。我们将位图滤波分为两类结构匹配算法,即基于导航的算法和基于连接的算法。实验结果表明,位图滤波能显著提高XML结构匹配的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bitmap Filtering: An Efficient Speedup Method for XML Structural Matching
With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信