MKStream: An Efficient Algorithm for Processing Multiple Keyword Queries over XML Streams

摘要

In this paper, we tackle the problem of processing various keyword-based queries over XML streams in a scalable way, improving recent multi-query processing approaches. We propose a customized algorithm, called MKStream, that relies on parsing stacks designed for simultaneously matching several queries. Particularly, it explores the possibility of adjusting the number of parsing stacks for a better trade-off between processing time and memory usage. A comprehensive set of experiments evaluates its performance and scalability against the state-of-the-art, and shows that MKStream is the most efficient algorithm for keyword search services over XML streams.