Khalil Amiri, Sanghyun Park, et al.
ICDE 2003
We present a streaming algorithm for evaluating XPath expressions that use backward axes (parent and ancestor) and forward axes in a single document-order traversal of an XML document. Other streaming XPath processors handle only forward axes. We show through experiments that our algorithm significantly outperforms (by more than a factor of two) a traditional non-streaming XPath engine. Furthermore, our algorithm scales better because it retains only the relevant portions of the input document in memory. Our engine successfully processes documents over 1GB in size, whereas the traditional XPath engine degrades considerably in performance for documents over 100 MB in size and fails to complete for documents of size over 200 MB.
Khalil Amiri, Sanghyun Park, et al.
ICDE 2003
Vijayshankar Raman, Amol Deshpande, et al.
ICDE 2003
Frances Allen, Michael Burke, et al.
Journal of Parallel and Distributed Computing
Philippe Charles, Christian Grothoff, et al.
OOPSLA 2005