XPath Node Selection over Grammar-Compressed Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

XPath Node Selection over Grammar-Compressed Trees


XML document markup is highly repetitive and therefore well compressible using grammar-based compression. Downward, navigational XPath can be executed over grammar-compressed trees in PTIME: the query is translated into an automaton which is executed in one pass over the grammar. This result is well-known and has been mentioned before. Here we present precise bounds on the time complexity of this problem, in terms of big-O notation. For a given grammar and XPath query, we consider three different tasks: (1) to count the number of nodes selected by the query (2) to materialize the pre-order numbers of the selected nodes, and (3) to serialize the subtrees at the selected nodes.

Dates and versions

hal-00878748 , version 1 (30-10-2013)



Tom Sebastian, Sebastian Maneth. XPath Node Selection over Grammar-Compressed Trees. TTATT 2013, Oct 2013, Hanoi, Vietnam. ⟨10.4204/EPTCS.134.5⟩. ⟨hal-00878748⟩
136 View
0 Download



Gmail Facebook Twitter LinkedIn More