G. Miklau and D. Suciu. Containment and equivalence of tree patterns. University of Washington Technical Report (TR 02-02-03), February 2002. http://www.cs.washington.edu/homes/gerome.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....over alphabet , to boolean patterns over alphabet [ fx1 ; x2 ; xkg such that for any k ary patterns p; p and their translations p; p if and only if p p . Figure 3 shows a pattern p of arity 3, and the boolean pattern p which is its translation. The full version [16] of this abstract includes the formal proof of Proposition 1. Containment and Equivalence The containment and equivalence problems are mutually reducible in polynomial time. Equivalence is simply two way con (a) b) c) c a b b b c c c c a a b a b b c b d b z c z a a z Figure 2: ....

..... For example, the algorithm should run in PTIME when we impose some bound on, say, the number of s. Unfortunately, for two of the three features this is not possible, as shown in the next two theorems. Technically, these are the most dicult results in the paper; their proofs are included in [16]. Theorem 2 (coNP bounded wildcard) Given has at most 2 label wildcards, deciding p p is coNPcomplete. Theorem 3 (coNP bounded branching) Given has at most 5 branches and p has at most 3 branches, deciding p p is coNP complete. Given these additional lower ....

[Article contains additional citation context not shown here]

G. Miklau and D. Suciu. Containment and equivalence of tree patterns. University of Washington Technical Report (TR 02-02-03), February 2002. http://www.cs.washington.edu/homes/gerome.

No context found.

G. Miklau and D. Suciu. Containment and equivalence of tree patterns. University of Washington Technical Report (TR 02-02-03), February 2002. http://www.cs.washington.edu/homes/gerome.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC