1 / 10

In The Name Of God

In The Name Of God. Tree Matching Problem with Application to Semi-structured Database Dr. Rahgozar Dr. Sirjani Mostafa Haghir Chehreghani. General tree inclusion problem: given a pattern tree P and a target tree T, locate the sub-trees of T that are instances of P

serena
Download Presentation

In The Name Of God

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. In The Name Of God Tree Matching Problem with Application to Semi-structured Database Dr. Rahgozar Dr. Sirjani Mostafa Haghir Chehreghani

  2. General tree inclusion problem: given a pattern tree P and a target tree T, locate the sub-trees of T that are instances of P • Specific tree inclusion problem: fixing the instance relation that specifies the instances of each pattern • Applications: • Functional language • Syntactic OCR • Semi-structure Database Mining

  3. Semi-structure Database Mining • E.g. Xml Database or Bioinformatics Database • Data Mining in these databases: • Content Mining • Structure Mining • Frequent tree patterns • Complexity of Tree Matching: • O(mn) • m: size of P • n: size of T

  4. Unordered tree inclusion • A function f from the nodes of P to nodes of T is an embedding of P into T, if it preserves labels and ancestor ship • Conditions: • f(u) = f(v) • Label(u) = label(f(u)) • u is an ancestor of v in P if and only if f(u) is an ancestor of f(v) in T

  5. Unordered tree inclusion

  6. Unordered path inclusion • Path embedding: it preserves the parent relation

  7. Unordered region inclusion • let f be a path embeddings of P in T • Region embedding: if u,v f(V) and v is a right sibling of u, all nodes of T that are right siblings of u and left siblings of v belong to f(V)

  8. Unordered child inclusion • Child embedding: it preserves the number of children of the internal nodes

  9. Unordered sub-tree inclusion • P is unordered sub-tree of T if: P is isomorphic to a sub-tree of T

  10. Any Question:

More Related