An Efficient XPath Query Processor for XML Streams
Document Type Conference Paper
Conference 2006 IEEE. Reprinted from Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, April 2006, 12 pages.
Publisher URL: http://dx.doi.org/10.1109/ICDE.2006.18
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
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.
Date Posted: 13 February 2007
This document has been peer reviewed.