Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
XML to Relational Conversion Using Theory of Regular Tree Grammars
Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
A New Algorithm for the Ordered Tree Inclusion Problem
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Tree inclusion algorithm, signatures and evaluation of path-oriented queries
Proceedings of the 2006 ACM symposium on Applied computing
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Language and Automata Theory and Applications
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
The tree inclusion problem: in optimal space and faster
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Considering that the unranked tree languages L(G) and L(G′) are those defined by given possibly-recursive XML typesG and G′, this paper proposes a method to verify whether L(G) is "approximatively" included in L(G′). The approximation consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.