Issue No. 01 - Jan. (2013 vol. 25)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.209
Jérôme Darmont , Université de Lyon (ERIC Lyon 2), Bron
Marouane Hachicha , Université de Lyon (ERIC Lyon 2), Bron
With XML becoming a ubiquitous language for data interoperability purposes in various domains, efficiently querying XML data is a critical issue. This has lead to the design of algebraic frameworks based on tree-shaped patterns akin to the tree-structured data model of XML. Tree patterns are graphic representations of queries over data trees. They are actually matched against an input data tree to answer a query. Since the turn of the 21st century, an astounding research effort has been focusing on tree pattern models and matching optimization (a primordial issue). This paper is a comprehensive survey of these topics, in which we outline and compare the various features of tree patterns. We also review and discuss the two main families of approaches for optimizing tree pattern matching, namely pattern tree minimization and holistic matching. We finally present actual tree pattern-based developments, to provide a global overview of this significant research topic.
XML, Pattern matching, Vegetation, Algebra, Optimization, Data models, Computers, tree pattern rewriting, XML querying, data tree, tree pattern, tree pattern query, twig pattern, matching, containment, tree pattern minimization, holistic matching, tree pattern mining
Jérôme Darmont, Marouane Hachicha, "A Survey of XML Tree Patterns", IEEE Transactions on Knowledge & Data Engineering, vol. 25, no. , pp. 29-46, Jan. 2013, doi:10.1109/TKDE.2011.209