matching tree patterns on partial trees
play

Matching Tree Patterns on Partial-trees Optimizing Tree-Pattern - PowerPoint PPT Presentation

Dec 04, 2022 •285 likes •1.07k views

Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Matching Tree Patterns on Partial-trees Optimizing Tree-Pattern Matching Shachar Harussi Supervision of Prof. Amir Averbuch September 1,

  1. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Matching Tree Patterns on Partial-trees Optimizing Tree-Pattern Matching Shachar Harussi Supervision of Prof. Amir Averbuch September 1, 2011 Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  2. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur 1 Motivation: Graph querying 2 Background: tree patterns 3 Partial trees - holistic divide and concur Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  3. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Outline 1 Motivation: Graph querying 2 Background: tree patterns 3 Partial trees - holistic divide and concur Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  4. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Motivation Everything is a graph. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  5. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Motivation(cont.) We need to query everything. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  6. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Lets take a picture A picture is a graph. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  7. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Lets take a picture A picture is a graph. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  8. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Holistic approach Given a graph pattern. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  9. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Holistic approach Given a graph pattern. And a graph data, Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  10. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Holistic approach Given a graph pattern. And a graph data, The solution is O O. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  11. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur But Holistic is hard A Problem: Holistic pattern matching is NP-hard. Even subgraph isomorphism problem [8] is hard. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  12. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur But Holistic is hard A Problem: Holistic pattern matching is NP-hard. Even subgraph isomorphism problem [8] is hard. A Solution: divide and concur. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  13. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local is easy Divide the pattern a local patterns P i , Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  14. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local is easy Divide the pattern a local patterns P i , And local data D i . Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  15. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local is easy Divide the pattern a local patterns P i , And local data D i . Partial solutions O O. Strings matching is fast O ( P i × D i ) Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  16. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local is easy Divide the pattern a local patterns P i , And local data D i . Partial solutions O O. Strings matching is fast O ( P i × D i ) Join (Concur) Final solution O O. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  17. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur So local approach is perfect ? The answer is NO Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  18. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur So local approach is perfect ? The answer is NO The concur is a Pyrrhic victory - i.e. the join costs. But lets focus on trees. Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  19. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Outline 1 Motivation: Graph querying 2 Background: tree patterns 3 Partial trees - holistic divide and concur Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  20. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Tree Data Model v 1 a v 2 ‘ Tree pattern ’ is a tree b v 3 v 4 c d Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  21. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur The local approach problem an example query : ‘/a/b[/c]/d’ v 1 a v 2 v 4 v 7 b b b v 6 v 3 v 5 v 8 c c d d Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  22. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur The local approach problem an example query : ‘/a/b[/c]/d’ 1. path1 (‘/a/b/c’): v 1 ( v 1 , v 2 , v 3 ), ( v 1 , v 4 , v 5 ) a v 2 v 4 v 7 b b b v 6 v 3 v 5 v 8 c c d d Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  23. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur The local approach problem an example query : ‘/a/b[/c]/d’ 1. path1 (‘/a/b/c’): v 1 ( v 1 , v 2 , v 3 ), ( v 1 , v 4 , v 5 ) a 2. path2 (‘/a/b/d’): ( v 1 , v 4 , v 6 ), ( v 1 , v 7 , v 8 ) v 2 v 4 v 7 b b b v 6 v 3 v 5 v 8 c c d d Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  24. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur The local approach problem an example query : ‘/a/b[/c]/d’ 1. path1 (‘/a/b/c’): v 1 ( v 1 , v 2 , v 3 ), ( v 1 , v 4 , v 5 ) a 2. path2 (‘/a/b/d’): ( v 1 , v 4 , v 6 ), ( v 1 , v 7 , v 8 ) 3.joins: v 2 v 4 v 7 ( v 1 , v 2 , v 3 , ) b b b ( v 1 , v 4 , v 5 , ) ( v 1 , v 4 , , v 6 ) v 6 v 3 v 5 v 8 ( v 1 , v 7 , , v 8 ) c c d d Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  25. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur The local approach problem an example query : ‘/a/b[/c]/d’ 1. path1 (‘/a/b/c’): v 1 ( v 1 , v 2 , v 3 ), ( v 1 , v 4 , v 5 ) a 2. path2 (‘/a/b/d’): ( v 1 , v 4 , v 6 ), ( v 1 , v 7 , v 8 ) 3.joins: v 2 v 4 v 7 ( v 1 , v 2 , v 3 , ) b b b ( v 1 , v 4 , v 5 , ) ( v 1 , v 4 , , v 6 ) v 6 v 3 v 5 v 8 ( v 1 , v 7 , , v 8 ) c c d d 4. answer : ( v 1 , v 4 , v 5 , v 6 ) Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  26. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local structural-indexes Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  27. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local structural-indexes Tree representation that is: small, enables querying Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  28. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local structural-indexes Tree representation that is: small, enables querying Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

  29. Outline Motivation: Graph querying Background: tree patterns Partial trees - holistic divide and concur Local structural-indexes Tree representation that is: small, enables querying The current indexes (Dataguide [5],1-index [3]) are: Shachar Harussi Supervision of Prof. Amir Averbuch Matching Tree Patterns on Partial-trees

Recommend

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees Anatomy of a Tree a In CS, we look at trees Node from the bottom up Basic element of the tree b c Contains a piece of

321 views • 5 slides
AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17

AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17

1 8 6 z 4 3 v AVL Trees AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17 78 binary search tree 1 2 1 88 32 50 such that for every 1 1 internal node v of T, 48 62 the heights of

453 views • 9 slides
Pattern avoidance in trees Introduction Brief history Contiguous tree patterns Lara Pudwell

Pattern avoidance in trees Introduction Brief history Contiguous tree patterns Lara Pudwell

Pattern avoidance in trees Lara Pudwell Pattern avoidance in trees Introduction Brief history Contiguous tree patterns Lara Pudwell (Valparaiso University) Definition & examples faculty.valpo.edu/lpudwell Enumeration Non-

1.34k views • 57 slides
AVL Trees AVL Tree AVL trees are Height of an AVL Tree 4 balanced. 44 Insertion and

AVL Trees AVL Tree AVL trees are Height of an AVL Tree 4 balanced. 44 Insertion and

AVL Trees AVL Tree AVL trees are Height of an AVL Tree 4 balanced. 44 Insertion and restructuring An AVL Tree is a 2 3 Removal and restructuring 17 78 binary search tree Costs 1 2 1 such that for every 32 50 88 internal

294 views • 7 slides
Pattern matching with the su ffi x tree Zsuzsanna Lipt ak Masters in Medical Bioinformatics

Pattern matching with the su ffi x tree Zsuzsanna Lipt ak Masters in Medical Bioinformatics

Bioinformatics Algorithms (Fundamental Algorithms, module 2) Pattern matching with the su ffi x tree Zsuzsanna Lipt ak Masters in Medical Bioinformatics academic year 2018/19, II. semester Su ffi x Trees 2 2 / 18 Recall: Pattern matching

522 views • 3 slides
CS 220: Discrete Structures and their Applications Trees Chapter 11 in zybooks trees A tree is

CS 220: Discrete Structures and their Applications Trees Chapter 11 in zybooks trees A tree is

CS 220: Discrete Structures and their Applications Trees Chapter 11 in zybooks trees A tree is an undirected graph that is connected and has no cycles. rooted trees Rooted trees. Given a tree T, choose a root node r and orient each edge

814 views • 52 slides
Trees (Part 2) 1 / 59 Trees (Part 2) Recap Recap 2 / 59 Trees (Part 2) Recap B + Tree A B

Trees (Part 2) 1 / 59 Trees (Part 2) Recap Recap 2 / 59 Trees (Part 2) Recap B + Tree A B

Trees (Part 2) Trees (Part 2) 1 / 59 Trees (Part 2) Recap Recap 2 / 59 Trees (Part 2) Recap B + Tree A B + Tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and

811 views • 59 slides
Lecture 1: Trees, tree metric and tree spaces Piotr Zwiernik University of Genoa Algebraic

Lecture 1: Trees, tree metric and tree spaces Piotr Zwiernik University of Genoa Algebraic

Introduction Trees Tree metrics Phylogenetic oranges Tree correlations Further concepts Lecture 1: Trees, tree metric and tree spaces Piotr Zwiernik University of Genoa Algebraic Statistics 2015 Genova June 11, 2015 Lecture 1: Trees,

976 views • 85 slides
TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS

TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS

TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS A local planning authority can serve a TPO on tree(s) when it is expedient to do so. Such trees need to: Have a reasonable degree of

333 views • 10 slides
Binary Search Trees A binary search tree is a binary tree T such that - each internal node

Binary Search Trees A binary search tree is a binary tree T such that - each internal node

AVL T REES Binary Search Trees AVL Trees AVL Trees 1 Binary Search Trees A binary search tree is a binary tree T such that - each internal node stores an item (k, e) of a dictionary. - keys stored at nodes in the left subtree of

547 views • 26 slides
Decision Tree Decision Trees A decision tree is a decision support tool that uses a tree-like

Decision Tree Decision Trees A decision tree is a decision support tool that uses a tree-like

Decision Tree Decision Trees A decision tree is a decision support tool that uses a tree-like graph or model of decisions and their possible MSE 2400 EaLiCaRA consequences, including chance event Dr. Tom Way outcomes, resource costs, and

568 views • 8 slides
Trees a tree represents a hierarchy - organization structure of a corporation Electronics

Trees a tree represents a hierarchy - organization structure of a corporation Electronics

T REES trees binary trees traversals of trees template method pattern data structures for trees Trees 1 Trees a tree represents a hierarchy - organization structure of a corporation Electronics RUs R&D

434 views • 18 slides
Recursion on Trees 7 January 2019 OSU CSE 1 Structure of Trees Two views of a tree: A

Recursion on Trees 7 January 2019 OSU CSE 1 Structure of Trees Two views of a tree: A

Recursion on Trees 7 January 2019 OSU CSE 1 Structure of Trees Two views of a tree: A tree is made up of: A root node A string of zero or more child nodes of the root, each of which is the root of its own tree A tree is

557 views • 37 slides
Tries and String Matching Where We've Been Fundamental Data Structures Red/black trees,

Tries and String Matching Where We've Been Fundamental Data Structures Red/black trees,

Tries and String Matching Where We've Been Fundamental Data Structures Red/black trees, B-trees, RMQ, etc. Isometries Red/black trees 2-3-4 trees, binomial heaps binary numbers, etc. Amortized Analysis Aggregate,

920 views • 65 slides
CSE 373: AVL trees Question: is this also an AVL tree? 2 5 6 10 9 8 12 11 13 14 5 AVL

CSE 373: AVL trees Question: is this also an AVL tree? 2 5 6 10 9 8 12 11 13 14 5 AVL

CSE 373: AVL trees Question: is this also an AVL tree? 2 5 6 10 9 8 12 11 13 14 5 AVL tree invariants review 6 4 2 1 4 3 5 8 7 12 10 9 11 13 3 7 Michael Lee Question: is this a valid AVL tree? Friday, Jan 19, 2018 1

371 views • 6 slides
B-trees (Bayer-McCreight, 1972) B tree of order m is a tree with the following properties

B-trees (Bayer-McCreight, 1972) B tree of order m is a tree with the following properties

B-trees (Bayer-McCreight, 1972) B tree of order m is a tree with the following properties Height-balanced trees 1 The root has at least two children unless it is a leaf 2 No node in the tree has more than m children B trees 3 Every node except

1.02k views • 4 slides
Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition

Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition

1 CSCI 104 B-Trees (2-3, 2-3-4) and Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition 2-3 Tree is a tree where a 2 Node 4 Non-leaf nodes have 1 value & 2 children or 2 values and 3

998 views • 75 slides
CS261 Data Structures Trees Introduction and Applications Goals Tree Terminology and

CS261 Data Structures Trees Introduction and Applications Goals Tree Terminology and

CS261 Data Structures Trees Introduction and Applications Goals Tree Terminology and Definitions Tree Representation Tree Application Examples of Trees Trees Ubiquitous they are everywhere in CS Probably ranks third

690 views • 54 slides
Trees Tiziana Ligorio 1 Todays Plan Trees Binary Tree ADT Binary Search Tree ADT 2

Trees Tiziana Ligorio 1 Todays Plan Trees Binary Tree ADT Binary Search Tree ADT 2

Trees Tiziana Ligorio 1 Todays Plan Trees Binary Tree ADT Binary Search Tree ADT 2 Announcements Questions? 3 ADT Operations we have seen so far Bag, List, Stack, Queue Add data to collection Remove data from

1.44k views • 117 slides
Trees Chapter 19, 20 Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013 Scope

Trees Chapter 19, 20 Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013 Scope

Trees Chapter 19, 20 Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013 Scope 2 Trees : Trees as data structures Tree terminology Tree implementations Analyzing tree efficiency Tree traversals Expression

672 views • 55 slides
Spanning Trees Spanning Trees g Trees: CSE 680 Not Trees: Prof. Roger Crawfis Not Has

Spanning Trees Spanning Trees g Trees: CSE 680 Not Trees: Prof. Roger Crawfis Not Has

Tree Introduction to Algorithms Introduction to Algorithms We call an undirected graph a tree if the graph We call an undirected graph a tree if the graph is connected and contains no cycles . Spanning Trees Spanning Trees g Trees:

186 views • 17 slides
AVL Trees Section 4.4 39 AVL Tree A balanced tree Ensures log running time for

AVL Trees Section 4.4 39 AVL Tree A balanced tree Ensures log running time for

AVL Trees Section 4.4 39 AVL Tree A balanced tree Ensures log running time for search, insert, and delete A simple and relaxed definition for balance log log : Too restrictive 40 Balanced Tree Height(null) =

415 views • 14 slides
kd-Trees CMSC 420 kd-Trees Invented in 1970s by Jon Bentley Name originally meant

kd-Trees CMSC 420 kd-Trees Invented in 1970s by Jon Bentley Name originally meant

kd-Trees CMSC 420 kd-Trees Invented in 1970s by Jon Bentley Name originally meant 3d-trees, 4d-trees, etc where k was the # of dimensions Now, people say kd-tree of dimension d Idea: Each level of the tree compares

703 views • 19 slides
Partial Matching between Surfaces U i Using Frchet Distance F h t Di t Carola Wenk

Partial Matching between Surfaces U i Using Frchet Distance F h t Di t Carola Wenk

Partial Matching between Surfaces U i Using Frchet Distance F h t Di t Carola Wenk University of Texas at San Antonio J i t Joint work with Jessica Sherette k ith J i Sh tt Geometric Shape Matching p g Consider geometric

289 views • 28 slides

More recommend