CDO: extremely high-throughput road distance computations on city road networks

Some analytic queries on road networks, usually concentrating in a local area spanning several cities, need a high-throughput solution such as performing millions of shortest distance computations per second. However, most existing solutions achieve less than 5, 000 shortest distance computations per second per machine even with multi-threads. We demonstrate a solution, termed City Distance Oracles (CDO), using our previously developed ε-distance oracle to achieve as many as 7 million shortest distance computations per second per commodity machine on a city road network, i.e., 10K × 10K origin-distance (OD) matrix can be finished in 14 seconds.