FastMatch:an efficient algorithm for XML keyword search
FastMatch:一种高效的XML关键字查询算法

Existing methods of XML keyword search need firstly identify qualified root nodes satisfying specified semantics, then construct subtree results that meet some certain conditions. Such a strategy needs to process all nodes in the inverted lists more than once, so it is inefficient in practice. To solve this problem, this paper proposed a method used fast group to reduce the times of scaning the inverted lists, then proposed a algorithm named FastMatch based on the method.This algorithm found all subtree results meeting some certain conditions by scanning all nodes in the inverted lists only once. The experimental results verify the high performance of this method.