Abstract
Reachability queries are of great importance in many research and application areas, including general graph mining, social network analysis and so on. Many approaches have been proposed to compute whether there exists one path from one node to another node in a graph. Most of these approaches focus on static graphs, however in practice dynamic graphs are more common. In this paper, we focus on handling graph reachability queries in dynamic graphs. Specifically we investigate the influence of a given edge in the graph, aiming to study the overall reachability changes in the graph brought by the possible failure/deletion of the edge. To this end, we firstly develop an efficient update algorithm for handling edge deletions. We then define the edge influence concept and put forward a novel computation algorithm to accelerate the computation of edge influence. We evaluate our approach using several real world datasets. The experimental results show that our approach outperforms traditional approaches significantly.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
https://www.statista.com/statistics/264810/number-of-monthly-active-facebook-users-worldwide/, retrieved December 2016.
- 2.
BFS & DFS refers to Breadth-First-Search and Depth-First-Search. Both our method and BFS & DFS were performed on top of the updated labeling index.
References
Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: Dyreson, C.E., Li, F., Tamer Özsu, M. (eds.) SIGMOD Conference 2014, Snowbird, UT, USA, pp. 1323–1334, 22-27 June 2014. doi:10.1145/2588555.2612181. http://dl.acm.org/citation.cfm?id=2588555
Cheng, J., et al.: TF-Label: a topological-folding labeling scheme for reachability querying in a large graph. In: Proceedings of the International Conference on Management of Data. ACM (2013)
Wang, H., et al.: Dual labeling: answering graph reachability queries in constant time. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006. IEEE (2006)
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases, vol. 18, no. 2. ACM (1989)
Jin, R., et al.: Efficiently answering reachability queries on very large directed graphs. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM (2008)
Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. (TODS) 15(4), 558–598 (1990)
Cohen, E., et al.: Reachability, distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003)
Bramandia, R., Choi, B., Ng, W.K.: Incremental maintenance of 2-hop labeling of large graphs. IEEE Trans. Knowl. Data Eng. 22(5), 682–698 (2010)
Yildirim, H., Chaoji, V., Zaki, M.J.: Dagger: a scalable index for reachability queries in large dynamic graphs. arXiv preprint arXiv:1301.0977 (2013)
Leskovec, J.: Stanford large network dataset collection (2014). http://snap.stanford.edu/data/index.html
Yildirim, H., Chaoji, V., Zaki, M.J.: GRAIL: scalable reachability index for large graphs. PVLDB 3(1), 276–284 (2010)
van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: SIGMOD, pp. 913–924 (2011)
Seufert, S., Anand, A., Bedathur, S.J., Weikum, G.: Ferrari: flexible and efficient reachability range assignment for graph indexing. In: ICDE, pp. 1009–1020 (2013)
Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In: ICDE, pp. 360–371 (2005)
Acknowledgments
Authors would like to thank Xiaorong Liang for the implementation of the algorithms and thank anonymous reviewers for their valuable comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Qin, Y., Sheng, Q.Z., Parkinson, S., Falkner, N.J.G. (2017). Edge Influence Computation in Dynamic Graphs. In: Candan, S., Chen, L., Pedersen, T., Chang, L., Hua, W. (eds) Database Systems for Advanced Applications. DASFAA 2017. Lecture Notes in Computer Science(), vol 10178. Springer, Cham. https://doi.org/10.1007/978-3-319-55699-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-55699-4_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55698-7
Online ISBN: 978-3-319-55699-4
eBook Packages: Computer ScienceComputer Science (R0)