Abstract
Reachability query is a fundamental problem which has been studied extensively due to its important role in various application domains, such as social networks, communication networks, biological networks, etc. However, few existing works pay attention to the problem of how two vertices are connected. In this paper, we investigate the problem of discovering paths of multiple resolutions connecting two vertices in large scale networks. We propose a new structure, called Muti-Resolution Path (MRP), to describe how two vertices are connected at different resolution levels. To facilitate the building of MRPs on a network of large scale, we propose a new search structure, called Hierarchical Compressed Network (HCN), which can represent a network at multiple resolution levels and can be built offline. At last, extensive experiments conducted on real-world datasets verify the effectiveness and efficiency of the proposed approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases, vol. 18. ACM (1989)
Akiba, T., Hayashi, T., Nori, N., Iwata, Y., Yoshida, Y.: Efficient top-k shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 2–8 (2015)
Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on DAGS. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 493–504. VLDB Endowment (2005)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003)
Jagadish, H.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. (TODS) 15(4), 558–598 (1990)
Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29(3), 683–697 (2017)
Trißl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 845–856. ACM (2007)
Veloso, R.R., Cerf, L., Meira Jr, W., Zaki, M.J.: Reachability queries in very large graphs: a fast refined online search approach. In: EDBT, pp. 511–522 (2014)
Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: answering graph reachability queries in constant time. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 75. IEEE (2006)
Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. Proc. VLDB Endow. 7(12), 1191–1202 (2014)
Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)
Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: scalable reachability index for large graphs. Proc. VLDB Endow. 3(1–2), 276–284 (2010)
Yıldırım, H., Chaoji, V., Zaki, M.J.: Grail: a scalable index for reachability queries in very large graphs. VLDB J. Int. J. Very Large Data Bases 21(4), 509–534 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, Z., Yang, N., Yu, P.S. (2019). How to Reach: Discovering Multi-resolution Paths on Large Scale Networks. In: Shao, J., Yiu, M., Toyoda, M., Zhang, D., Wang, W., Cui, B. (eds) Web and Big Data. APWeb-WAIM 2019. Lecture Notes in Computer Science(), vol 11641. Springer, Cham. https://doi.org/10.1007/978-3-030-26072-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-26072-9_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26071-2
Online ISBN: 978-3-030-26072-9
eBook Packages: Computer ScienceComputer Science (R0)