The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
Abstract. In this paper we propose a new approach to XML benchmarking – a flexible XML query benchmark called FlexBench. The flexibility is given by two aspects. Firstly, FlexB...
We introduce the new notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the first scalable query language for XML streams (running strictly in linear time with bounded mem...
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...