In this article we investigate a novel execution paradigm - ML-like pattern-matching - for XML query processing. We show that such a paradigm is well adapted for a common and frequent set of queries and advocate that it constitutes a candidate for efficient execution of XML queries far better than the current XPath-based query mechanisms. We support our claim by comparing performances of XPath-based queries with pattern based ones, and by comparing the latter with the two efficiency-best XQuery processor we are aware of. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Benzaken, V., Castagna, G., & Miachon, C. (2005). A full pattern-based paradigm for XML query processing. In Lecture Notes in Computer Science (Vol. 3350, pp. 235–252). Springer Verlag. https://doi.org/10.1007/978-3-540-30557-6_18
Mendeley helps you to discover research relevant for your work.