Mohamed S. Hassan
ABSTRACT
A variety of applications spanning various domains, e.g., social networks, transportation, and bioinformatics, have graphs as first-class citizens. These applications share a vital operation, namely, finding the shortest path between two nodes. In many scenarios, users are interested in filtering the graph before finding the shortest path. For example, in social networks, one may need to compute the shortest path between two persons on a sub-graph containing only family relationships. This paper focuses on dynamic graphs with labeled edges, where the target is to find a shortest path after filtering some edges based on user-specified query labels. This problem is termed the Edge-Constrained Shortest Path query (or ECSP, for short). This paper introduces Edge-Disjoint Partitioning (EDP, for short), a new technique for efficiently answering ECSP queries over dynamic graphs. EDP has two main components: a dynamic index that is based on graph partitioning, and a traversal algorithm that exploits the regular patterns of the answers of ECSP queries. The main idea of EDP is to partition the graph based on the labels of the edges. On demand, EDP computes specific sub-paths within each partition and updates its index. The computed sub-paths act as pre-computations that can be leveraged by future queries. To answer an ECSP query, EDP connects sub-paths from different partitions using its efficient traversal algorithm. EDP can dynamically handle various types of graph updates, e.g., label, edge, and node updates. The index entries that are potentially affected by graph updates are invalidated and re-computed on demand. EDP is evaluated using real graph datasets from various domains. Experimental results demonstrate that EDP can achieve query performance gains of up to four orders of magnitude in comparison to state of the art techniques.
- https://www.census.gov/geo/maps-data/data/tiger.html.Google Scholar
- http://thebiogrid.org.Google Scholar
- I. Abraham, D. Delling, A. V. Goldberg, and R. F. F. Werneck. Hierarchical hub labelings for shortest paths. In Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10--12, 2012. Proceedings, pages 24--35, 2012. Google ScholarDigital Library
- H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes. In transit to constant time shortest-path queries in road networks. In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007. Google ScholarDigital Library
- F. Bonchi, A. Gionis, F. Gullo, and A. Ukkonen. Chromatic correlation clustering. In The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '12, Beijing, China, August 12--16, 2012, pages 1321--1329, 2012. Google ScholarDigital Library
- F. Bonchi, A. Gionis, F. Gullo, and A. Ukkonen. Distance oracles in edge-labeled graphs. In Proc. 17th International Conference on Extending Database Technology (EDBT), Athens, Greece, March 24--28, 2014., pages 547--558, 2014.Google Scholar
- D. Delling and D. Wagner. Landmark-based routing in dynamic graphs. In Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6--8, 2007, Proceedings, pages 52--65, 2007. Google ScholarDigital Library
- E. W. Dijkstra. A note on two problems in connection with graphs. Numerical Mathematics, 1:269--271, 1959. Google ScholarDigital Library
- R. Geisberger, M. N. Rice, P. Sanders, and V. J. Tsotras. Route planning with flexible edge restrictions. ACM Journal of Experimental Algorithmics, 17(1), 2012. Google ScholarDigital Library
- R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings, pages 319--333, 2008. Google ScholarDigital Library
- A. V. Goldberg, H. Kaplan, and R. F. F. Werneck. Better landmarks within reach. In Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6--8, 2007, Proceedings, pages 38--51, 2007. Google ScholarDigital Library
- M. N. Rice and V. J. Tsotras. Graph indexing of road networks for shortest path queries with label restrictions. PVLDB, 4(2):69--80, 2010. Google ScholarDigital Library
- H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10--12, 2008, pages 43--54, 2008. Google ScholarDigital Library
- J. Sankaranarayanan, H. Alborzi, and H. Samet. Efficient query processing on spatial networks. In 13th ACM International Workshop on Geographic Information Systems, ACM-GIS 2005, November 4--5, 2005, Bremen, Germany, Proceedings, pages 200--209, 2005. Google ScholarDigital Library
- A. Shimbel. Applications of matrix algebra to communication nets. Bulletin of Mathematical Biophysics, 13:165--78, 1951.Google ScholarCross Ref
- A. Shimbel. Structural parameters of communication networks. Bulletin of Mathematical Biophysics, 15:501--507, 1953.Google ScholarCross Ref
- S. N. Simoes, D. C. Martins-Jr, H. Brentani, and R. Fumio. Shortest paths ranking methodology to identify alterations in ppi networks of complex diseases. In Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine, BCB '12, pages 561--563, 2012. Google ScholarDigital Library
Index Terms
- Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
Recommendations
Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
We propose TEDI, an indexing for solving shortest path, and k Nearest Neighbors (kNN) problems. TEDI is based on the tree decomposition methodology. The graph is first decomposed into a tree in which the node contains vertices. The shortest paths are ...
Shortest paths in Sierpiński graphs
In 23], Klav ar and Milutinović (1997) proved that there exist at most two different shortest paths between any two vertices in Sierpiński graphs S k n , and showed that the number of shortest paths between any fixed pair of vertices of S k n can be ...
On shortest disjoint paths in planar graphs
For a graph G and a collection of vertex pairs {(s"1,t"1),...,(s"k,t"k)}, the k disjoint paths problem is to find k vertex-disjoint paths P"1,...,P"k, where P"i is a path from s"i to t"i for each i=1,...,k. In the corresponding optimization problem, the ...
Comments