== Results for cache of size 5 and look ahead of 0 km. ==

APPENDIX A: results of individual tests using default algorithm and cache of size 5

Test with starting point at Dartmoor using default (linear) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 57).

Point furthest from centre of cache (25000000, 07000000) is 2409670, 0708950; distance away is: 9.1351 kilometres

Results for Dartmoor (OS 250,070) using default (linear) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
99% 5 2
98% 16 10
96% 51 34
93% 258 226

Default matching algorithm used was: (version pjb May 29 2002) .

Commentary on this starting point: the cache is centred on a wild moorland area.

Test with starting point at Exeter using default (linear) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 88).

Point furthest from centre of cache (29200000, 09200000) is 2919520, 0926490; distance away is: 0.608276 kilometres

Results for Exeter (OS 292,092) using default (linear) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
99% 28 18
98% 49 34
96% 159 134
93% 465 425

Default matching algorithm used was: (version pjb May 29 2002) .

Commentary on this starting point: this may be a favourable case as the cache is centred on an area with lots of attractions, and the area outside the cache has fewer attractions.

Test with starting point at Plymouth using default (linear) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 39).

Point furthest from centre of cache (24700000, 05300000) is 2451887, 0527313; distance away is: 1.92354 kilometres

Results for Plymouth (OS 247,053) using default (linear) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
99% 25 16
98% 49 35
96% 152 128
93% 376 337

Default matching algorithm used was: (version pjb May 29 2002) .

Commentary on this starting point: this may be a favourable case as the cache is centred on an area with lots of attractions, and the area outside the cache has fewer attractions; the cache may, however, be smaller as Plymouth is on the sea, so part of the cache area covers the sea -- which has no tourist attractions.

Test with starting point at Somerton using default (linear) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 73).

Point furthest from centre of cache (35000000, 13000000) is 3546793, 1238844; distance away is: 7.7201 kilometres

Results for Somerton (OS 350,130) using default (linear) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
99% 6 6
98% 25 20
96% 164 144
93% 483 444

Default matching algorithm used was: (version pjb May 29 2002) .

Commentary on this starting point: the cache is centred on non-prime tourist area, but there are prime areas nearby.

APPENDIX B: results of individual tests using research library algorithm and cache of size 5

Test with starting point at Dartmoor using research library (N-squared) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 89).

Point furthest from centre of cache (25000000, 07000000) is 2589097, 0735721; distance away is: 9.56347 kilometres

Results for Dartmoor (OS 250,070) using research library (N-squared) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
50% 0 0
20% 1 1
10% 13 7
5% 340 302

Non-default algorithm used was: Context Matcher with N-squared location-matching algorithm: version of Nov 4 2002.

Commentary on this starting point: the cache is centred on a wild moorland area.

Test with starting point at Exeter using research library (N-squared) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 122).

Point furthest from centre of cache (29200000, 09200000) is 2835605, 0825684; distance away is: 12.7475 kilometres

Results for Exeter (OS 292,092) using research library (N-squared) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
50% 1 1
20% 10 10
10% 42 37
5% 534 499

Non-default algorithm used was: Context Matcher with N-squared location-matching algorithm: version of Nov 4 2002.

Commentary on this starting point: this may be a favourable case as the cache is centred on an area with lots of attractions, and the area outside the cache has fewer attractions.

Test with starting point at Plymouth using research library (N-squared) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 67).

Point furthest from centre of cache (24700000, 05300000) is 2417616, 0563023; distance away is: 6.2434 kilometres

Results for Plymouth (OS 247,053) using research library (N-squared) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
50% 0 0
20% 6 5
10% 41 33
5% 426 383

Non-default algorithm used was: Context Matcher with N-squared location-matching algorithm: version of Nov 4 2002.

Commentary on this starting point: this may be a favourable case as the cache is centred on an area with lots of attractions, and the area outside the cache has fewer attractions; the cache may, however, be smaller as Plymouth is on the sea, so part of the cache area covers the sea -- which has no tourist attractions.

Test with starting point at Somerton using research library (N-squared) matching algorithm and cache size 5

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 5. (Size is set as a fixed value, derived from original size of 99).

Point furthest from centre of cache (35000000, 13000000) is 3409139, 1203868; distance away is: 13.3004 kilometres

Results for Somerton (OS 350,130) using research library (N-squared) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
50% 0 0
20% 1 0
10% 13 10
5% 561 520

Non-default algorithm used was: Context Matcher with N-squared location-matching algorithm: version of Nov 4 2002.

Commentary on this starting point: the cache is centred on non-prime tourist area, but there are prime areas nearby.

APPENDIX C: summary for cache built with 20km square and 0km look-ahead and cache of size 5

RUNS USING DEFAULT (LINEAR) ALGORITHMS

Total number of tables is 4. Total size of the 4 caches is 20. Total number of retrievals (over the 11 retrieval points) from the cache is 2311. Total number of retrievals lost is 2013.

RUNS USING N-SQUARED ALGORITHMS

Total number of tables is 4. Total size of the 4 caches is 20. Total number of retrievals (over the 11 retrieval points) from the cache is 1989. Total number of retrievals lost is 1808.

APPENDIX D: summary of results for different amounts of look-ahead and cache of size 5

Total size of the 48 caches is 240. Average cache size is 5. Maximum cache size is 5. Minimum cache size is 5.

Results summary
Algorithm Look-ahead Benchmark retrievals Retrievals lost
default 0 2311 2013
default 3 2311 1945
default 5 2311 1928
default 10 2311 1932
default 15 2311 1983
default 20 2311 2074
research 0 1989 1808
research 3 1989 1776
research 5 1989 1769
research 10 1989 1757
research 15 1989 1773
research 20 1989 1826