Journal of the ACM (JACM)
Shortest-path feasibility algorithms: An experimental evaluation
Journal of Experimental Algorithmics (JEA)
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Shortest path querying is a fundamental graph problem which is computationally quite challenging when operating over massive scale graphs. Recent results have addressed the problem of computing either exact or good approximate shortest path distances efficiently. Some of these techniques also return the path corresponding to the estimated shortest path distance fast. However, none of these techniques work very well when we have additional constraints on the labels associated with edges that constitute the path. In this paper, we develop SkIt index structure, which supports a wide range of label constraints on paths, and returns an accurate estimation of the shortest path that satisfies the constraints. We conduct experiments over graphs such as social networks, and knowledge graphs that contain millions of nodes/edges, and show that SkIt index is fast, accurate in the estimated distance and has a high recall for paths that satisfy the constraints.