for each dst in my.out_edges if dst.depth > my.depth+1 then - PowerPoint PPT Presentation

• •

for each dst in my.out_edges if dst.depth > my.depth+1 then dst.depth = my.depth+1

0 1 2 3 I 1 I 2 0, 1 2, 3 S 1 S 2 SS 1.1 SS 1.1 SS 1.2 1 → 2 0,1 → 3 SS 2.1 SS 2.2 3 → 0 3 → 2 2,3 → 1

             

0 1 2 3 I 1 0,1,2,3 S 1 SS 1.1 SS 1.1 3 → 0 2 → 1 3 → 1 1 → 2 3 → 2 0 → 3 1 → 3

I 1 I 2 I 3 I 4 I i 0, 1 2, 3 4, 5 6 vertices In-memory S 1 S 2 S 3 S 4 ping-pong SS 1.3 SS 1.4 SS 1.1 SS 1.1 SS 1.2 I 1 interval 1 2 1 4 0 6 0, 1 0,1 3 0 5 SS i.j SS 2.1 SS 2.2 SS 2.3 SS 2.4 I 2 sorted 3 0 3 4 edges 3 2 2, 3 2,3 1 3 5 Sub-shard without hub SS 3.1 SS 3.2 SS 3.3 SS 3.4 I 3 5 2 5 4 4 1 4 6 4, 5 4,5 3 4 5 Execution SS 4.1 SS 4.2 SS 4.3 SS 4.4 I 4 order 6 1 6 4 6

I i vertices On-disk S 1 S 2 S 3 S 4 interval SS 1.3 SS 1.4 SS 1.1 SS 1.1 SS 1.2 I 1 1 2 1 4 0 6 SS i.j 0, 1 0 5 0,1 3 edges SS 2.1 SS 2.2 SS 2.3 SS 2.4 Sub-shard I 2 3 0 3 4 with a hub 3 2 2, 3 2,3 1 3 5 Hub SS 3.1 SS 3.2 SS 3.3 SS 3.4 I 3 attached to 5 2 5 4 a sub-shard 4 6 4 1 4, 5 4,5 3 4 5 SS 4.1 SS 4.2 SS 4.3 SS 4.4 I 4 Execution 6 1 6 4 6 order

I 1 I 2 I 3 I 4 I i 0, 1 2, 3 4, 5 6 vertices On-disk S 1 S 2 S 3 S 4 interval SS 1.3 SS 1.4 SS 1.1 SS 1.1 SS 1.2 1 2 1 4 SS i.j 0 6 0,1 3 0 5 edges Sub-shard SS 2.1 SS 2.2 SS 2.3 SS 2.4 with a hub 3 0 3 4 3 2 2,3 1 3 5 Hub SS 3.1 SS 3.2 SS 3.3 SS 3.4 attached to 5 2 5 4 a sub-shard 4 1 4 6 4,5 3 4 5 Execution SS 4.1 SS 4.2 SS 4.3 SS 4.4 order 6 1 6 4

I 1 I 2 I 1 I 2 I 3 I 4 0, 1 2, 3 0, 1 2, 3 4, 5 6 S 1 S 2 S 3 S 4 S 1 S 2 S 3 S 4 SS 1.1 SS 1.1 SS 1.2 SS 1.3 SS 1.4 SS 1.1 SS 1.1 SS 1.2 SS 1.3 SS 1.4 I 1 I 1 1 2 1 4 1 2 1 4 0 6 0 6 0, 1 0, 1 0,1 3 0 5 0,1 3 0 5 SS 2.1 SS 2.2 SS 2.3 SS 2.4 SS 2.1 SS 2.2 SS 2.3 SS 2.4 I 2 I 2 3 0 3 4 3 0 3 4 3 2 3 2 2, 3 2, 3 2,3 1 3 5 2,3 1 3 5 SS 3.1 SS 3.2 SS 3.3 SS 3.4 SS 3.1 SS 3.2 SS 3.3 SS 3.4 I 3 5 2 5 4 5 2 5 4 4 1 4 6 4 1 4 6 4, 5 4,5 3 4 5 4,5 3 4 5 SS 4.1 SS 4.2 SS 4.3 SS 4.4 SS 4.1 SS 4.2 SS 4.3 SS 4.4 I 4 6 1 6 4 6 1 6 4 6 Hub I i I i SS i.j SS i.j attached to Execution vertices vertices edges edges a sub-shard order On-disk In-memory Sub-shard Sub-shard interval ping-pong with a hub without hub interval

   