Improvement of XML filtering based on deterministic finite automaton
Xiaoqin Xie · Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University · 2011
The invalidation of cache during XML data filtering would reduce efficiency of filtering,so,it is of great significance to improving the performance of filtering to research how to reduce invalidity of cache during XML data filtering on the basis of deterministic finite automation(DFA).A proposal for improvement of XML filtering was put forward on the basis of the Lazy DFA.For each node in the automaton,a state transition counter was added to build a frequently accessed area.By setting an access threshold for the counter,the data in the cache could be filtered.The nodes whose counter value exceeds the threshold are identified as frequently accessed areas of the state.Experiments prove that this proposal can greatly reduce the search time during the transition between a large number of automation states in the cache,thus increasing the efficiency of filtering and query performance.