Sciweavers

Share
ICDE
2006
IEEE

An Efficient XPath Query Processor for XML Streams

9 years 7 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML data is recursive. In this paper, we use a compact data structure to encode these pattern matches rather than storing them explicitly. We then propose a polynomial time streaming algorithm to evaluate XPath queries by probing the data structure in a lazy fashion. Extensive experiments show that our approach not only has a good theoretical complexity bound but is also efficient in practice.
Yi Chen, Susan B. Davidson, Yifeng Zheng
Added 01 Nov 2009
Updated 01 Nov 2009
Type Conference
Year 2006
Where ICDE
Authors Yi Chen, Susan B. Davidson, Yifeng Zheng
Comments (0)
books