mso queries on trees
play

MSO Queries on Trees Enumerating Answers under Updates Using Forest - PowerPoint PPT Presentation

Aug 15, 2022 •252 likes •1.35k views

Introduction Monoids + HPD Forest Algebras Circuits MSO Queries on Trees Enumerating Answers under Updates Using Forest Algebras Matthias Niewerth 1 Introduction Monoids + HPD Forest Algebras Circuits Problem Description Query

  1. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Stepwise Tree Automaton Node Selecting String Automaton 11

  2. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Stepwise Tree Automaton Node Selecting String Automaton Extended Transition Monoid 11

  3. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Stepwise Tree Automaton Node Selecting String Automaton Tree Extended Transition Monoid 11

  4. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Stepwise Tree Automaton Node Selecting String Automaton Tree HPD Extended Strings Transition Monoid 11

  5. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Stepwise Tree Automaton Node Selecting String Automaton Tree HPD Extended Strings Transition Monoid Index Structure 11

  6. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Node Selecting Stepwise Tree Automaton Stepwise Tree Automaton Node Selecting String Automaton Tree HPD Extended Strings Transition Monoid Index Structure 11

  7. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Node Selecting Stepwise Tree Automaton Stepwise Tree Automaton Node Selecting String Automaton Tree HPD Extended Extended Strings Transition Algebra Transition Monoid Index Structure 11

  8. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Node Selecting Stepwise Tree Automaton Stepwise Tree Automaton Node Selecting String Automaton Tree HPD Extended Extended Strings Tree Transition Algebra Transition Monoid Index Structure 11

  9. Introduction Monoids + HPD Forest Algebras Circuits Structure of Algorithm Node Selecting Node Selecting Stepwise Tree Automaton Stepwise Tree Automaton Node Selecting String Automaton Tree HPD Extended Extended Strings Tree Transition Algebra Transition Monoid Index Index Structure Structure 11

  10. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Examples a a b b = b d ‘ d b d d concatenation c c 12

  11. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Examples a a b b = b d ‘ d b d d concatenation c c a c a d context = d e c e application b f b d � f 12

  12. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Examples a a b b = b d ‘ d b d d concatenation c c a c a d context = d e c e application b f b d � f a c a � context = d e c e application b � f b � f 12

  13. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra Free Forest Algebra all forests H V all contexts concatenation ‘ context application d 13

  14. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra Free Forest Algebra all forests H V all contexts concatenation ‘ context application d Atomic Formulas empty forest ε empty context � atomic forests a , b , . . . a � , b � , . . . atomic contexts 13

  15. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra Free Forest Algebra all forests H V all contexts concatenation ‘ context application d Atomic Formulas empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  16. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra tree Free Forest Algebra a all forests H e b V all contexts concatenation c ‘ d context application d Atomic Formulas empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  17. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula tree Free Forest Algebra a d all forests H a � e b ‘ V all contexts concatenation c e ‘ d d context application d b � ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  18. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula tree Free Forest Algebra a d all forests H a � e b ‘ V all contexts concatenation c e ‘ d d context application d b � ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  19. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula tree Free Forest Algebra a d all forests H a � e b ‘ V all contexts concatenation c e ‘ d d context application d b � ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  20. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula tree Free Forest Algebra a d all forests H a � e b ‘ V all contexts concatenation c e ‘ d d context application d b � ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  21. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula tree a d a � e b ‘ c e d d b � ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  22. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula alternative formula tree a d d a � e b ‘ d ‘ a � c e c d d ‘ d b � b � e ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  23. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula alternative formula tree a d d a � e b ‘ d ‘ a � c e c d d ‘ d b � b � e ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  24. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula alternative formula tree a d d a � e b ‘ d ‘ a � c e c d d ‘ d b � b � e ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts 13

  25. Introduction Monoids + HPD Forest Algebras Circuits Forest Algebras in a Nutshell Free Forest Algebra formula alternative formula tree a d d a � e b ‘ d ‘ a � c e c d d ‘ d b � b � e ‘ Atomic Formulas c d empty forest ε a empty context � a � = atomic forests a , b , . . . � a � , b � , . . . atomic contexts The leaves of the formula correspond to the nodes of the tree. 13

  26. Introduction Monoids + HPD Forest Algebras Circuits How to Decompose a Tree (to a log-depth Formula) t 14

  27. Introduction Monoids + HPD Forest Algebras Circuits How to Decompose a Tree (to a log-depth Formula) t How to decompose a tree? 14

  28. Introduction Monoids + HPD Forest Algebras Circuits How to Decompose a Tree (to a log-depth Formula) t How to decompose a tree? 1 t = c d f c d c f f c 1 c 2 c 3 f 1 c 4 f 2 14

  29. Introduction Monoids + HPD Forest Algebras Circuits How to Decompose a Tree (to a log-depth Formula) t How to decompose a tree? 1 t = c d f c d c f f c 1 c 2 c 3 f 1 c 4 f 2 14

  30. Introduction Monoids + HPD Forest Algebras Circuits How to Decompose a Tree (to a log-depth Formula) t How to decompose a tree? 1 t = c d f c 1 2 c = c 1 d c 2 c 2 d d f f c 1 c 2 c 3 f 1 c 4 f 2 14

  31. Introduction Monoids + HPD Forest Algebras Circuits How to Decompose a Tree (to a log-depth Formula) t How to decompose a tree? 1 t = c d f c 1 2 c = c 1 d c 2 3 c 2 = f 1 ‘ c 3 c 3 f 1 d d f f c 1 ‘ c 3 f 1 c 4 f 2 14

  32. Introduction Monoids + HPD Forest Algebras Circuits How to Decompose a Tree (to a log-depth Formula) t How to decompose a tree? 1 t = c d f c 1 2 c = c 1 d c 2 3 c 2 = f 1 ‘ c 3 c 4 c 3 4 f 1 = c 4 d f 2 d f 2 d f f c 1 ‘ c 3 d c 4 f 2 14

  33. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas ‘ 3 ‘ 1 2 15

  34. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas ‘ ‘ 3 1 ‘ ‘ 1 2 2 3 15

  35. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas ‘ ‘ 3 1 ‘ ‘ 1 2 2 3 15

  36. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas d d 3 1 d d 1 2 2 3 15

  37. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas d d 3 1 d d 1 2 2 3 ‘ ‘ ‘ 4 1 ‘ ‘ ‘ ‘ 1 1 2 3 4 4 ‘ ‘ 2 3 2 3 15

  38. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas d d 3 1 d d 1 2 2 3 d d d 4 1 d d d d 1 1 2 3 4 4 d d 2 3 2 3 15

  39. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas d d 3 1 d d 1 2 2 3 15

  40. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas d d 3 1 d d 1 2 2 3 ‘ d 2 3 d ‘ 1 3 1 2 1 is a context 2 is a forest 15

  41. Introduction Monoids + HPD Forest Algebras Circuits Rebalancing Forest Algebra Formulas d d 3 1 d d 1 2 2 3 ‘ d ‘ 2 3 1 d ‘ d 1 3 1 2 2 3 1 is a context 2 is a forest 1 is a forest 2 is a context 15

  42. Introduction Monoids + HPD Forest Algebras Circuits Result Theorem Enumertion of MSO formulas on trees can be done in time: O ( | Q | 6 · | S | · 2 k · n ) Preprocessing O ( | Q | 6 · | S | · 2 k · k · log( n ) ) Delay O ( | Q | 6 · | S | · 2 k · log( n ) ) Updates n size of tree | Q | number of states | S | number of accepting tuples k arity of the query 16

  43. Introduction Monoids + HPD Forest Algebras Circuits Contents Monoids and Heavy Path Decomposition ( M , d , ε ) Forest Algebras Enumeration using Circuits = d 17

  44. Introduction Monoids + HPD Forest Algebras Circuits Related Work Simons Heavy Path Set valued Krohn Rhodes Factorization Decomposition Circuits Theorem Forests [ABJM17] [BPV04,LM14] [NS17] Forest [KS13] Algebras O (1) O (log 2 ( n )) O (1) O (1) O (log 2 ( n )) O (log( n )) Krohn Rhodes only strings Theorem This Paper for Trees? O (log( n )) O (log( n )) Follow-Up? O (1) O (log( n )) Reference Delay Update 18

  45. Introduction Monoids + HPD Forest Algebras Circuits Related Work Simons Heavy Path Set valued Krohn Rhodes Factorization Decomposition Circuits Theorem Forests [ABJM17] [BPV04,LM14] [NS17] Forest [KS13] Algebras O (1) O (log 2 ( n )) O (1) O (1) O (log 2 ( n )) O (log( n )) Krohn Rhodes only strings [ABM18] Theorem O (1) This Paper for Trees? O (log( n )) O (log( n )) only relabel O (log( n )) Follow-Up? O (1) O (log( n )) Reference Amarilli, Bourhis, Mengel Delay Enumeration on Trees under Relabelings ICDT 2018 Update 18

  46. Introduction Monoids + HPD Forest Algebras Circuits Enumeration using Circuits [ABM18] ∪ ⊠ ⊠ ¬ � B :1 � ∪ ∪ � B :1 � ⊠ ⊠ ⊠ ⊠ ¬ � x :2 � ¬ � x :3 � � B :2 � � x :2 � � B :3 � � x :3 � � B :2 � � B :3 � 19

  47. Introduction Monoids + HPD Forest Algebras Circuits Enumeration using Circuits [ABM18] ∪ ⊠ ⊠ ¬ � B :1 � ∪ ∪ � B :1 � ⊠ ⊠ ⊠ ⊠ ¬ � x :2 � ¬ � x :3 � � B :2 � � x :2 � � B :3 � � x :3 � � B :2 � � B :3 � Problem: depth(circuit) ∈ Ω(depth(tree)) 19

  48. Introduction Monoids + HPD Forest Algebras Circuits Enumeration using Circuits [ABM18] ∪ ⊠ ⊠ ¬ � B :1 � ∪ ∪ � B :1 � ⊠ ⊠ ⊠ ⊠ ¬ � x :2 � ¬ � x :3 � � B :2 � � x :2 � � B :3 � � x :3 � � B :2 � � B :3 � Problem: depth(circuit) ∈ Ω(depth(tree)) Solution: tree decomposition of input tree 19

  49. Introduction Monoids + HPD Forest Algebras Circuits Enumeration using Circuits [ABM18] ∪ ⊠ ⊠ ¬ � B :1 � ∪ ∪ � B :1 � ⊠ ⊠ ⊠ ⊠ ¬ � x :2 � ¬ � x :3 � � B :2 � � x :2 � � B :3 � � x :3 � � B :2 � � B :3 � Problem: depth(circuit) ∈ Ω(depth(tree)) Solution: tree decomposition of input tree Better Solution: use forest algebra formulas 19

  50. Introduction Monoids + HPD Forest Algebras Circuits Related Work Simons Heavy Path Set valued Krohn Rhodes Factorization Decomposition Circuits Theorem Forests [ABJM17] [BPV04,LM14] [NS17] Forest [KS13] Algebras O (1) O (log 2 ( n )) O (1) O (1) O (log 2 ( n )) O (log( n )) Krohn Rhodes only strings [ABM18] Theorem O (1) This Paper for Trees? O (log( n )) O (log( n )) only relabel O (log( n )) Follow-Up? O (1) O (log( n )) Reference Amarilli, Bourhis, Mengel Delay Enumeration on Trees under Relabelings ICDT 2018 Update 20

  51. Introduction Monoids + HPD Forest Algebras Circuits Related Work Simons Heavy Path Set valued Krohn Rhodes Factorization Decomposition Circuits Theorem Forests [ABJM17] [BPV04,LM14] [NS17] Forest [KS13] Algebras O (1) O (log 2 ( n )) O (1) O (1) O (log 2 ( n )) O (log( n )) Krohn Rhodes only strings [ABM18] Theorem O (1) This Paper for Trees? O (log( n )) O (log( n )) only relabel O (log( n )) Follow-Up? O (1) O (log( n )) Future Reference O (1) Delay Update O (log( n )) 20

  52. Introduction Monoids + HPD Forest Algebras Circuits Related Work Simons Heavy Path Set valued Krohn Rhodes Factorization Decomposition Circuits Theorem Forests [ABJM17] [BPV04,LM14] [NS17] Forest [KS13] Algebras O (1) O (log 2 ( n )) O (1) O (1) O (log 2 ( n )) O (log( n )) Krohn Rhodes only strings [ABM18] Theorem O (1) This Paper for Trees? O (log( n )) O (log( n )) only relabel O (log( n )) Follow-Up? O (1) O (log( n )) Future Reference O (1) Delay Update O (log( n )) Thank You! 20

  53. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 q 0 a q 1 , q 3 , q 4 q 1 , q 3 q 0 , q 2 q 1 q 2 b q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  54. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a b b b q 1 , q 3 , q 4 q 1 , q 3 b q 0 , q 2 q 1 q 2 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  55. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 b q 0 , q 2 q 1 q 2 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  56. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 b q 0 , q 2 q 1 q 2 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  57. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  58. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  59. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 q 2 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  60. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 q 2 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  61. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 2 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 q 2 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  62. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 2 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 q 2 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  63. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 2 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 q 2 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  64. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 a q 0 a q 1 q 2 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 q 2 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

  65. Introduction Monoids + HPD Forest Algebras Circuits Node Selecting Stepwise Tree Automaton (Example) q 1 , q 3 q 4 a q 0 a q 1 q 2 q 1 b b b q 1 , q 3 , q 4 q 1 , q 3 q 2 b q 0 , q 2 q 1 q 2 q 0 b a q 1 , q 3 q 1 , q 3 q 2 q 3 q 4 a S = { ( q 4 , q 0 ) } Output all pairs of a -nodes that are connected by a path of b -nodes. 21

Recommend

Range Queries Part 3: Line Sweep, Subtree Queries, and Extra Topic in Segment Trees Lucca

Range Queries Part 3: Line Sweep, Subtree Queries, and Extra Topic in Segment Trees Lucca

Range Queries Part 3: Line Sweep, Subtree Queries, and Extra Topic in Segment Trees Lucca Siaudzionis and Jack Spalding-Jamieson 2020/02/11 University of British Columbia Announcements A3 is released. Its due Sunday, March 1st. You

921 views • 81 slides
Computational Geometry Lecture 14: Windowing queries Computational Geometry Lecture 14:

Computational Geometry Lecture 14: Windowing queries Computational Geometry Lecture 14:

Motivation Interval trees Priority search trees Windowing queries Computational Geometry Lecture 14: Windowing queries Computational Geometry Lecture 14: Windowing queries Motivation Interval trees Windowing queries Priority search trees

925 views • 79 slides
On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6

On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6

On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries 0 2 0 4 3 5 1 7 6 1 2 min? 3 6 4 5 7 LCA? Parallel Computing Day Ben-Gurion University Tuesday, October 20, 2009 RMQ 2 0 4 3 5 1 7 6 Tuesday,

1.37k views • 108 slides
Range Queries Part 2: Segment Trees and Lazy Propagation Lucca Siaudzionis and Jack

Range Queries Part 2: Segment Trees and Lazy Propagation Lucca Siaudzionis and Jack

Range Queries Part 2: Segment Trees and Lazy Propagation Lucca Siaudzionis and Jack Spalding-Jamieson 2020/02/06 University of British Columbia Announcements A2 is due Sunday!!! Jack will be hosting additional office hours from

822 views • 63 slides
R-Trees and applications Efficient grid queries in the Dynamo reservoir modelling software

R-Trees and applications Efficient grid queries in the Dynamo reservoir modelling software

R-Trees and applications Efficient grid queries in the Dynamo reservoir modelling software R-Tree Project A.N. Yzelman (UU) Supervisors A.N. Swart (Alten) G.L.G. Sleijpen (UU) Project Owners Eric Haesen (Alten) Hans Molenaar (Shell)

514 views • 28 slides
Queries in PSM The following rules apply to the use of queries: CS 235: 1. Queries

Queries in PSM The following rules apply to the use of queries: CS 235: 1. Queries

Queries in PSM The following rules apply to the use of queries: CS 235: 1. Queries returning a single value can be Introduction to Databases used in assignments 2. Queries returning a single tuple can be used Svetlozar Nestorov with

530 views • 4 slides
( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees

( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees

B- B -Trees Trees B B- -Trees Trees Search for key R ( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees Trees Each Disk-Read or Disk-Write = one Basic unit of work O(1) Typical Node x

287 views • 4 slides
Computational Geometry Lecture 8: Range trees 1 Computational Geometry Lecture 8: Range trees

Computational Geometry Lecture 8: Range trees 1 Computational Geometry Lecture 8: Range trees

Introduction 2D Range trees Degenerate cases Range trees Computational Geometry Lecture 8: Range trees 1 Computational Geometry Lecture 8: Range trees Introduction 2D Range trees Range queries Degenerate cases Database queries G.

878 views • 66 slides
Range queries and Fenwick Trees Version 1.1 Yaseen Mowzer 2nd IOI Training Camp 2017 (3 February

Range queries and Fenwick Trees Version 1.1 Yaseen Mowzer 2nd IOI Training Camp 2017 (3 February

Range queries and Fenwick Trees Version 1.1 Yaseen Mowzer 2nd IOI Training Camp 2017 (3 February 2018) Preliminaries All ranges will be half open ranges e [ a , b ) a e < b Occasionally 1 is a more convenient starting

726 views • 38 slides
Range queries Fenwick trees Yaseen Mowzer 2nd IOI Training Camp 2017 (4 February 2017)

Range queries Fenwick trees Yaseen Mowzer 2nd IOI Training Camp 2017 (4 February 2017)

Range queries Fenwick trees Yaseen Mowzer 2nd IOI Training Camp 2017 (4 February 2017) Preliminaries All ranges will be half open ranges e [ a , b ) a e < b Occasionally 1 is a more convenient starting index than 0

535 views • 38 slides
Week 5+ Oliver Kullmann Dynamic sets BinaryTrees Trees Implementing rooted trees Dynamic

Week 5+ Oliver Kullmann Dynamic sets BinaryTrees Trees Implementing rooted trees Dynamic

CS 270 Algorithms Week 5+ Oliver Kullmann Dynamic sets BinaryTrees Trees Implementing rooted trees Dynamic sets 1 The notion of binary search tree Trees 2 Queries in binary search trees Implementing rooted trees 3

833 views • 52 slides
Computational Geometry Lecture 15: Windowing queries Computational Geometry Lecture 15:

Computational Geometry Lecture 15: Windowing queries Computational Geometry Lecture 15:

Motivation Segment trees Windowing again Windowing queries Computational Geometry Lecture 15: Windowing queries Computational Geometry Lecture 15: Windowing queries Motivation Segment trees Windowing queries Windowing again Windowing

605 views • 48 slides
Massive Data Algorithmics Lecture 4: External Search Trees Massive Data Algorithmics Lecture 4:

Massive Data Algorithmics Lecture 4: External Search Trees Massive Data Algorithmics Lecture 4:

Introduction Weight-balanced B-tree Persistent trees Massive Data Algorithmics Lecture 4: External Search Trees Massive Data Algorithmics Lecture 4: External Search Trees Introduction Range queries Weight-balanced B-tree 1D range queries

774 views • 39 slides
/ + - * * 5 3 2 6 5 2 Examples Binary Trees BSTs Augmenting BinExpr General Trees

/ + - * * 5 3 2 6 5 2 Examples Binary Trees BSTs Augmenting BinExpr General Trees

Trees Readings: HtDP , sections 14, 15, 16. Topics: Introductory examples and terminology Binary trees Binary search trees Augmenting trees Binary expression trees General arithmetic expression trees Nested lists Examples Binary Trees

1.19k views • 31 slides
Module 14: Analyzing Queries Overview Queries That Use the AND Operator the OR

Module 14: Analyzing Queries Overview Queries That Use the AND Operator the OR

Module 14: Analyzing Queries Overview Queries That Use the AND Operator the OR Operator Join Operations Queries That Use the AND Operator Processing the AND Operator Returns rows that meet all conditions for every

231 views • 12 slides
New Requirements Top-N/Bottom-N queries Interactive queries Decision making

New Requirements Top-N/Bottom-N queries Interactive queries Decision making

Lecture 13 Lecture 13 Advanced Query Processing CS5208 Advanced QP 1 New Requirements Top-N/Bottom-N queries Interactive queries Decision making queries Tolerant of errors approximate answers acceptable

675 views • 25 slides
Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees, binary search trees, and AVL and B-Trees. 2 Trees Trees are recursive data structures. They are useful for: representing items that have a tree

622 views • 27 slides
2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

CS 16: Balanced Trees 2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes store 1, 2, or 3 keys and have 2, 3, or 4 children, respectively All leaves have the same depth k n r b e h n r b e

800 views • 31 slides
Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees) Albert-Ludwigs-Universitt Freiburg Prof. Dr. Rolf Backofen Bioinformatics Group / Department of Computer Science Algorithms and Data Structures, January

884 views • 55 slides
AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees AVL trees S. Prasitjutrakul 1994 AVL Trees : I nsertion m m k k k u u k k m m v t u m m t t u k m u k u p v t k p v v

320 views • 16 slides
Synthesizing Sub-Range Queries on Tree Structures Shubhang Kulkarni & Pranav Annapindi Sup

Synthesizing Sub-Range Queries on Tree Structures Shubhang Kulkarni & Pranav Annapindi Sup

Synthesizing Sub-Range Queries on Tree Structures Shubhang Kulkarni & Pranav Annapindi Sup Context Dont know? Pre- image f L user Input Output (ex : File structure manipulations) Chill. We got you for trees Output = f

416 views • 14 slides
Computational Geometry Lecture 7: Range searching and kd-trees Computational Geometry Lecture 7:

Computational Geometry Lecture 7: Range searching and kd-trees Computational Geometry Lecture 7:

Introduction Kd-trees Range searching and kd-trees Computational Geometry Lecture 7: Range searching and kd-trees Computational Geometry Lecture 7: Range searching and kd-trees Introduction Database queries Kd-trees 1D range trees

791 views • 59 slides
Computational Geometry Lecture 7: Range searching and kd-trees Computational Geometry Lecture 7:

Computational Geometry Lecture 7: Range searching and kd-trees Computational Geometry Lecture 7:

Introduction Kd-trees Range searching and kd-trees Computational Geometry Lecture 7: Range searching and kd-trees Computational Geometry Lecture 7: Range searching and kd-trees Introduction Database queries Kd-trees 1D range trees

1.29k views • 60 slides
CPSC 490 DP and Range Queries Part 5: Binary Jumping, LCA; Part 1: Intro, Prefix Sums, Fenwick

CPSC 490 DP and Range Queries Part 5: Binary Jumping, LCA; Part 1: Intro, Prefix Sums, Fenwick

CPSC 490 DP and Range Queries Part 5: Binary Jumping, LCA; Part 1: Intro, Prefix Sums, Fenwick Trees Lucca Siaudzionis and Jack Spalding-Jamieson 2020/02/04 University of British Columbia Announcements Reminder: The upsolver for A1 is up.

828 views • 41 slides

More recommend