Tree Signatures and Unordered XML Pattern Matching

13 years 10 months ago

Download www.isgroup.unimo.it

We propose an efﬁcient approach for ﬁnding relevant XML data twigs deﬁned by unordered query tree speciﬁcations. We use the tree signatures as the index structure and ﬁnd qualifying patterns through integration of structurally consistent query path qualiﬁcations. An efﬁcient algorithm is proposed and its implementation tested on real-life data collections.

Pavel Zezula, Federica Mandreoli, Riccardo Martogl

Real-time Traffic

Consistent Query Path | Relevant Xml Data | SOFSEM 2004 | Theoretical Computer Science | Unordered Query Tree |

claim paper

» Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables

» An Experiment on the Matching and Reuse of XML Schemas

» Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables

» Unordered Tree Mining with Applications to Phylogeny

» Approximate Joins for DataCentric XML

» Seeded Tree Alignment and Planar Tanglegram Layout

» Tree Pattern Rewriting Systems

» SigMatch Fast and Scalable MultiPattern Matching

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	SOFSEM
Authors	Pavel Zezula, Federica Mandreoli, Riccardo Martoglia

Comments (0)

Sciweavers

Tree Signatures and Unordered XML Pattern Matching

Consistent Query Path | Relevant Xml Data | SOFSEM 2004 | Theoretical Computer Science | Unordered Query Tree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers