We use the query data from the first three years of the GPS trajectory dataset [1]}[2]}[3]} to decide which paths should be hosted at the edge, given a certain cache size. We use a greedy strategy, namely the fractional knapsack[4]} algorithm, and to enable this we sort all the paths according to their `normalized hit rate'. For any path hosted at the edge, we assume that it will result in a `hit' whenever a query has both its source and destination nodes on the path. Then, the normalized hit rate for a path is defined as the ratio of the number of hits to the total count of nodes forming that path. A path with high normalized hit rate can serve more queries per unit used cache size, if hosted at the edge. Finally, given any cache size, the fractional knapsack algorithm chooses to greedily host paths with the highest normalized hit rates.
