Abstract:
We propose an efficient approach of 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 stack-based algorithm is proposed and its implementation tested on real-life data collections.