Event-driven Evaluation of Grammar Queries

We present a solution for answering queries on XML streams. Our approach extends the class of queries for which streamed solutions have been proposed to the class of queries expressible by monadic second order logic. We provide an algorithm which efficiently answers the queries despite their large expressiveness. We show that the algorithm reports matches at the earliest possible time during the scan of the input which implicitly leads to high adaptiveness in terms of memory consumption. The efficiency is documented with an experimental evaluation of our approach.     «

We present a solution for answering queries on XML streams. Our approach extends the class of queries for which streamed solutions have been proposed to the class of queries expressible by monadic second order logic. We provide an algorithm which efficiently answers the queries despite their large expressiveness. We show that the algorithm reports matches at the earliest possible time during the scan of the input which implicitly leads to high adaptiveness in terms of memory consumption. The eff...     »