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.