Performance
The gDcc exposes several functions. The main use cases are:
- Distance 1 to 1: Calculates the distance from one coordinate to another. It returns the distance in meters, the time in seconds, and an abstract cost that can depend on either distance or time, or the roads used (for instance toll-roads)
- Distance 1 to N: Calculate the distance from one coordinate to several (N) other coordinates. The underlying algorithm means that a 1 to 1 calculation is only slightly faster than a 1 to N for almost an arbitrarily high value of N.
- Trace: Calculates the trace from one coordinate to another. It returns the same values as Distance 1 to 1, along with coordinatepairs describing the path.
- Trace N: Calculates N traces at once. Overheads in contacting services over the network means that doing a bulk lookup of N traces in one operation will be a lot faster than doing N individual lookups.
The gDcc is optimized to deliver results from a cache, so for the best results the end user is recommended to pre-burn their results.
SLA
These numbers are preliminary from a local developer machine, and the final production ready version will probably be a lot slower.
The time taken for the operations will vary based on your road-net, and the distance between coordinates. Ops/S = operations per second
| Operation | Cache (Ops/S) | Calculation (Ops/S) |
|---|---|---|
| Distance 1 to 1 | ?? | ?? |
| Distance 1 to 10 | 100 | 1.5 |
| Distance 1 to 100 | 16 | 1.5 |
| Distance 1 to 1000 | 2 | 1.3 |
| Trace | ?? | ?? |
| Trace 10 | 13 | 0.3 |
| Trace 100 | 3 | 0.02 |
| Trace 1000 | 0,2 | 0.002 |