Distance and path queries in graphs are fundamental to numerous applications,ranging from geographic navigation systems to Internet routing. Some of these applications involve huge graphs and yet require fast query answering. A new data structure is created for representing all distances in a graph. The data structure is distributed in the sense that it may be viewed as assigning labels to the vertices,such that a query involving vertices u and v may be answered using only the labels of u and v. In this pap...