BVC-PLL applies a novel batch vertex-centric model to parallelize pruned landmark labeling while preserving exact results, achieving lower costs than the original PLL even sequentially under a stated assumption.
1) iterates following the vertex rank (order): at the ith iteration, the vertex u with rank π(u) = i will be distributed to all other vertices in the graph using a BFS process
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!
BVC-PLL applies a novel batch vertex-centric model to parallelize pruned landmark labeling while preserving exact results, achieving lower costs than the original PLL even sequentially under a stated assumption.