摘要

With data increasing continually, data of XML are queried complexly. Several years, there are several algorithms, for example, TJFast which is by scanning repeatedly and make a lot of middle routes in the process of merging;the XML datasets are too uncertain to impose the efficiency of the query well by filtering. In our article, a new efficient index structure-FSM is proposed, which can avoid merging the unnecessary routes, and impose the efficiency of filtering. Through a lot of experiments, the efficiency of FSM is better than the former ones, and FSM also imposes the query performance. 1553-9105/

  • 出版日期2009

全文