Skip to main content

Table 4 Impact of blocks size and subgraphs length on the computational time in seconds

From: The MapReduce-based approach to improve the shortest path computation in large-scale road networks: the case of A* algorithm

l

\(G'_{size}\)

Total time \(T_{MRA^*}\)

\(B_{size} = 64\)

\(B_{size} = 128\)

\(B_{size} = 256\)

60

0.3

371

376

368

78

0.4

412

409

409

100

0.5

463

464

464

109

0.6

460

517

532

125

0.7

458

596

605

156

0.8

459

753

754

200

1

461

1003

1065

265

1.3

460

1008

1149

400

2

461

1004

1164

Average time

445

681

726