Abstract
Recently, reachability queries on large graphs have attracted much attention. Many state-of-the-art approaches leverage spanning tree to construct indexes. However, almost all of these work require indexes and original graph in memory simultaneously, which will limit the scalability. Thus, a new interval labeling approach called AILabel (Augmented Interval Label) is proposed in this paper. AILabel labels each node with quadruples. Index construction time of AILabel is O(m+n), which requires only one traversal through the graph. Besides, AILabel only needs index to answer the queries. We further proposed an approach D-AILabel based on AILabel to handle reachability queries on dynamic graph. Finally, experiments on real and synthetic datasets are conducted and prove that AILabel can efficiently scale to large graph and reachability queries on dynamic graph can be effectively handled by D-AILabel.
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
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Wang, H.: Managing and mining graph data. Springer, Heidelberg (2010)
Cohen, E., Halperin, E., Kaplan, H., et al.: Reachability and distance queries via 2-hop labels. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937–946. ACM Press, Philadelphia (2002)
Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. In: Ioannidis, Y., et al. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 961–979. Springer, Heidelberg (2006)
Cheng, J., Yu, J.X., Lin, X., et al.: Fast computing reachability labelings for large graphs with high compression rate. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, pp. 193–204. ACM Press, New York (2008)
Jin, R., Xiang, Y., Ruan, N., et al.: 3-hop: a high-compression indexing scheme for reachability query. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 813–826. ACM Press, New York (2009)
Dietz, P.F.: Maintaining order in a linked list. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 122–127. ACM Press, New York (1982)
Yıldırım, H., Chaoji, V., Zaki, M.J.: GRAIL: a scalable index for reachability queries in very large graphs. The VLDB Journal—The International Journal on Very Large Data Bases 21(4), 509–534 (2012)
Wang, H., He, H., Yang, J., et al.: Dual labeling: Answering graph reachability queries in constant time. In: Proceedings of the 22nd International Conference on Data Engineering, pp. 75–75. IEEE, Washington, DC (2006)
Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: Scalable reachability index for large graphs. Proceedings of the VLDB Endowment 3(1-2), 276–284 (2010)
Seufert, S., Anand, A., Bedathur, S., et al.: Ferrari: Flexible and efficient reachability range assignment for graph indexing. In: Proceedings of the 2013 IEEE International Conference on Data Engineering, pp. 1009–1020. IEEE, Washington, DC (2013)
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 Press, New York (2007)
Ning, X., De-Rong, S., Shuo, F., et al.: RIAIL: An Index Method for Reachability Query in Large Scale Graphs. Journal of Software 25(Suppl. (2)), 213–224 (2014)
Zhang, Z., Yu, J.X., Qin, L., et al.: I/O cost minimization: reachability queries processing over massive graphs. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 468–479. ACM Press, New York (2012)
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, pp. 253–262. ACM Press, New York (1989)
Yildirim, H., Chaoji, V., Zaki, M.J., Dagger, Z.M.J.: A scalable index for reachability queries in large dynamic graphs[EB/OL] (2014). http://arxiv.org/abs/1301.0977
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Shuo, F., Ning, X., de-Rong, S., Nuo, L., Yue, K., Ge, Y. (2015). AILabel: A Fast Interval Labeling Approach for Reachability Query on Very Large Graphs. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds) Web Technologies and Applications. APWeb 2015. Lecture Notes in Computer Science(), vol 9313. Springer, Cham. https://doi.org/10.1007/978-3-319-25255-1_46
Download citation
DOI: https://doi.org/10.1007/978-3-319-25255-1_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25254-4
Online ISBN: 978-3-319-25255-1
eBook Packages: Computer ScienceComputer Science (R0)