This paper presents an XML partitioning technique that allows main- memory query engines to process a class of XQuery queries, that we dub iterative queries, on arbitrarily large input documents. We provide a static analysis technique to recognize these queries. The static analysis is based on paths extracted from queries and does not need additional schema information. We then provide an algorithm using path information for partitioning the input documents of iter- ative queries. This algorithm admits a streaming implementation, whose effectiveness is experimentally validated.