Tree Signatures and Unordered XML Pattern Matching

We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find qualifying patterns through integration of structurally consistent query path qualifications. An efficient algorithm is proposed and its implementation tested on real-life data collections.

• Type: Conference
• Year: 2004
• Where: SOFSEM
• Authors: Pavel Zezula, Federica Mandreoli, Riccardo Martoglia
• Keywords: Consistent Query Path, Relevant Xml Data, SOFSEM 2004, Theoretical Computer Science, Unordered Query Tree