An algorithm of keyword queries over XML streams

The current forms of keywords search over XML data streams are mainly based on SLCA results, which are incompleteness. This paper addresses this problem in another aspect. In this paper, a novel definition of complete ASLCA based on SLCA results is proposed to represent all possible results in the query. A novel kind of query algorithm is proposed. Extensively theoretical analysis and experiments have been performed to verify the better time complexity, space complexity, and recall ratio of the algorithms presented in this study.