Keyword Search on XML Streams

XPath&XQuery query processing on XML streams has become the hot topic and attracted many researchers’ attention. However, due to the relatively complex query language of XPath&XQuery , it is hard for users to get interesting data fragments via existing query interface without the prior knowledge of the schema information. As a result, it is becoming an impending issue to address the problem to provide uses with the most friendly query interface in XML streams according to the feathers of XML data. In this paper, we propose the problem of keyword search on XML streams for the first time and present the concept of smallest related connected subtree(SRCT), In addition, we design a novel stacked-based Lookup algorithm, which can efficiently solve the problem of keyword search on XML streams. Sufficient experiments show that our method is efficient in practice in various aspects.