基于DFA的XML过滤的改进

2009 Fourth International Conference on Internet Computing for Science and Engineering Pub Date : 2009-12-21 DOI:10.1109/ICICSE.2009.22

Guisheng Yin, Jie Shen, Xianghui Wang

{"title":"基于DFA的XML过滤的改进","authors":"Guisheng Yin, Jie Shen, Xianghui Wang","doi":"10.1109/ICICSE.2009.22","DOIUrl":null,"url":null,"abstract":"In this paper, an improvement proposal in the XML filting is put forward on the base of the Lazy DFA. For each node in the automaton, a transition counter is added to build a frequently access area. By setting a threshold of the counter, the data in the cache can be filtering. These nodes whose value of counter exceed are identified as frequently access areas of the state. This proposal can be greatly reduced the searching time during the transition between the states of automaton in a large number of states in the cache, and thus increase the efficiency of filtering and query performance.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Improvement of XML Filtering Based on DFA\",\"authors\":\"Guisheng Yin, Jie Shen, Xianghui Wang\",\"doi\":\"10.1109/ICICSE.2009.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an improvement proposal in the XML filting is put forward on the base of the Lazy DFA. For each node in the automaton, a transition counter is added to build a frequently access area. By setting a threshold of the counter, the data in the cache can be filtering. These nodes whose value of counter exceed are identified as frequently access areas of the state. This proposal can be greatly reduced the searching time during the transition between the states of automaton in a large number of states in the cache, and thus increase the efficiency of filtering and query performance.\",\"PeriodicalId\":193621,\"journal\":{\"name\":\"2009 Fourth International Conference on Internet Computing for Science and Engineering\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International Conference on Internet Computing for Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICSE.2009.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Conference on Internet Computing for Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2009.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文在延迟DFA的基础上，对XML过滤提出了改进建议。对于自动机中的每个节点，添加一个转换计数器以构建频繁访问区域。通过设置计数器的阈值，可以过滤缓存中的数据。计数器值超过的这些节点被标识为该状态的频繁访问区域。该方案可以大大减少在缓存中大量状态的自动机状态之间转换时的搜索时间，从而提高过滤效率和查询性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Improvement of XML Filtering Based on DFA

In this paper, an improvement proposal in the XML filting is put forward on the base of the Lazy DFA. For each node in the automaton, a transition counter is added to build a frequently access area. By setting a threshold of the counter, the data in the cache can be filtering. These nodes whose value of counter exceed are identified as frequently access areas of the state. This proposal can be greatly reduced the searching time during the transition between the states of automaton in a large number of states in the cache, and thus increase the efficiency of filtering and query performance.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 Fourth International Conference on Internet Computing for Science and Engineering

自引率

0.00%

发文量