An Association-Oriented Partitioning Approach for Streaming Graph Query

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static-preview.hindawi.com/articles/sp/volume-2017/2573592/figures/2573592.fig.001a.svgz" name="2573592.fig.001a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Edge-unlabeled graph</td></tr><tr class="fig-image" id="b"><td><object data="https://static-preview.hindawi.com/articles/sp/volume-2017/2573592/figures/2573592.fig.001b.svgz" name="2573592.fig.001b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Edge-labeled graph</td></tr></table>

<div>Example of unlabeled and labeled graph.</div>

Scientific Programming

fig1

Figure 1

Figure 1: An Association-Oriented Partitioning Approach for Streaming Graph Query 