Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Multi-Way Aggregation (2)

  • When DFS reaches a leaf node (e., d*), start backtracking
  • On every backtracking branch, the count in the corresponding trees are output, the tree is destroyed, and the node in the base tree is destroyed
  • Example
    • When traversing from d* back to c*, the a1b*c*/a1b*c* tree is output and destroyed
    • When traversing from c* back to b*, the a1b*D/a1b* tree is output and destroyed
    • When at b*, jump to b1 and repeat similar process

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.