An Experimental Evaluation of Two Methods on Shortest Distance Queries over Small-World Graphs

Efficient computation of shortest distances is a fundamental problem in graph databases. In this paper, we report our experimental evaluation and comparison of two state-of-the-art methods for exact distance computation over small-world graphs. Our experiment reveals some results that are not previously reported. These results provide insights on the pros and cons of each method, and on the possible directions these methods can be improved. They can also help us in choosing the right method for specific application scenarios.