Abstract
Large-scale graphs appear in many web applications, and are inevitable in web data management and mining. A lossless compression method for large-scale graphs, named as bound-triangulation, is introduced in this paper. It differs itself from other graph compression methods in that: 1) it can achieve both good compression ratio and low compression time. 2) The compression ratio can be controlled by users, so that compression ratio and processing performance can be balanced. 3) It supports efficient common neighbor query processing over compressed graphs. Thus, it can support a wide range of graph processing tasks. Empirical study over two real-life large-scale social networks, which different underlying data distributions, show the superior of the proposed method over other existing graph compression methods.
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
Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Proceedings of the Data Compression Conference, DCC 2001, pp. 203–212. IEEE (2001)
Blandford, D., Blelloch, G.E.: Index compression through document reordering. In: Proceedings of the Data Compression Conference, DCC 2002, pp. 342–351. IEEE (2002)
Boldi, P., Vigna, S.: The webgraph framework i: compression techniques. In: Proceedings of the 13th International Conference on World Wide Web, pp. 595–602. ACM (2004)
Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 95–106. ACM (2008)
Chaturvedi, A., Acharjee, T.: An efficient modified common neighbor approach for link prediction in social networks. IOSR Journal of Computer Engineering (IOSR-JCE) 12, 25–34 (2013)
Cui, H.: Link prediction on evolving data using tensor-based common neighbor. In: 2012 Fifth International Symposium on Computational Intelligence and Design (ISCID), vol. 2, pp. 343–346. IEEE (2012)
Gilbert, A.C., Levchenko, K.: Compressing network graphs. In: Proceedings of the LinkKDD Workshop at the 10th ACM Conference on KDD (2004)
Hannah, D., Macdonald, C., Ounis, I.: Analysis of link graph compression techniques. In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., White, R.W. (eds.) ECIR 2008. LNCS, vol. 4956, pp. 596–601. Springer, Heidelberg (2008)
Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing 7(4), 413–423 (1978)
Kang, U., Faloutsos, C.: Beyond’caveman communities’: Hubs and spokes for graph compression and mining. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 300–309. IEEE (2011)
Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical Computer Science 407(1), 458–473 (2008)
Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 606–609. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, L., Xu, C., Qian, W., Zhou, A. (2014). Common Neighbor Query-Friendly Triangulation-Based Large-Scale Graph Compression. In: Benatallah, B., Bestavros, A., Manolopoulos, Y., Vakali, A., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2014. WISE 2014. Lecture Notes in Computer Science, vol 8786. Springer, Cham. https://doi.org/10.1007/978-3-319-11749-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-11749-2_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11748-5
Online ISBN: 978-3-319-11749-2
eBook Packages: Computer ScienceComputer Science (R0)