Ankita Likhyani
Srikanta Bedathur
ABSTRACT
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.
Supplemental Material
Available for Download
Please ignore the attached zip file.
- Neo4J, the Graph Database. http://www.neo4j.org, 2013. {Online; accessed 31-May-2013}.Google Scholar
- B. V. Cherkassky, L. Georgiadis, A. V. Goldberg, R. E. Tarjan, and R. F. F. Werneck. Shortest-path feasibility algorithms: An experimental evaluation. ACM Journal of Experimental Algorithmics, 14, 2009. Google ScholarDigital Library
- A. Das Sarma, S. Gollapudi, M. Najork, and R. Panigrahy. A sketch-based distance oracle for web-scale graphs. In WSDM, 2010. Google ScholarDigital Library
- D. Delling, A. V. Goldberg, and R. F. F. Werneck. Shortest paths in road networks: From practice to theory and back. IT - Information Technology, 53(6):294--301, 2011.Google Scholar
- A. Gubichev, S. Bedathur, S. Seufert, and G. Weikum. Fast and accurate estimation of shortest paths in large graphs. In CIKM, 2010. Google ScholarDigital Library
- T. Neumann and G. Weikum. The RDF-3X engine for scalable management of RDF data. The VLDB Journal, 19(1):91--113, 2010. Google ScholarDigital Library
- M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM (JACM), 52(1):1--24, 2005. Google ScholarDigital Library
Index Terms
- Label constrained shortest path estimation
Recommendations
Generalization of Shortest Path Map
ITNG '10: Proceedings of the 2010 Seventh International Conference on Information Technology: New GenerationsWe consider the problem of constructing shortest path maps in two dimensions under angle constraint. Shortest path maps are used for planning short length paths from a fixed source point s to varying goal points. In the standard shortest path map the ...
Acceleration of shortest path and constrained shortest path computation
WEA'05: Proceedings of the 4th international conference on Experimental and Efficient AlgorithmsWe study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to ...
Reconfiguration graphs of shortest paths
AbstractFor a graph G anda , b ∈ V ( G ), the shortest path reconfiguration graph of G with respect to a andb is denoted by S ( G , a , b ). The vertex set of S ( G , a , b ) is the set of all shortest paths between a andb in G. Two vertices ...
Comments