Before revision:  For any constant c\geq 1, we propose two oracles: * The first oracle has size n^{2+1/c}(\log n/\epsilon)^{O(d)}\cdot \log W, answers a query in {\rm poly}(\log n,d^c,\log\log W,\epsilon^{-1}) time, and has stretch 1+\epsilon, for any constant \epsilon>0.
After revision:  For any constant c\geq 1, we propose two oracles: \bullet The first oracle has size n^{2+1/c}(\log n/\epsilon)^{O(d)}\cdot \log W, answers a query in {\rm poly}(\log n,d^c,\log\log W,\epsilon^{-1}) time, and has stretch 1+\epsilon, for any constant \epsilon>0.