Abstract | ||
---|---|---|
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 1 GB 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. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1109/ICDE.2003.1260813 | 19TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS |
Keywords | Field | DocType |
automata,engines,degradation,streaming algorithm,xml,tree data structures,data engineering,xml document,filtering,publish subscribe | Tree traversal,Streaming XML,Streaming algorithm,XML,Computer science,Tree (data structure),XPath,Simple API for XML,XPath 2.0,Database | Conference |
ISSN | Citations | PageRank |
1063-6382 | 65 | 3.73 |
References | Authors | |
4 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Charles Barton | 1 | 65 | 3.73 |
Philippe Charles | 2 | 570 | 34.55 |
Deepak Goyal | 3 | 141 | 8.90 |
Mukund Raghavachari | 4 | 288 | 26.11 |
Marcus Fontoura | 5 | 1116 | 61.74 |
Vanja Josifovski | 6 | 2265 | 148.84 |