Buffering in Query Evaluation over XML Streams Ziv Bar-Yossef   View Paper (PDF)   Return to Research Session 6: Complexity and Performance Evaluation / Data Stream Abstract 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 document stream. In many cases, these buffers grow very large and constitute a major memory bottleneck. In this paper, we identify two broad classes of evaluation prob- lems that independently necessitate the use of large memory buffers in evaluation of queries over XML streams: (1) full- fledged evaluation (as opposed to just filtering) of queries with predicates; (2) evaluation (whether full-fledged or filtering) of queries with "multi-variate" predicates. We prove quantitative lower bounds on the amount of memory required in each of these scenarios. The bounds are stated in terms of novel document properties that we define. We show that these scenarios, in combination with query evaluation over recursive documents, cover the cases in which large buffers are required. Finally, we present algorithms that match the lower bounds for an important fragment of XPath. ©2006 Association for Computing Machinery