Abstract
Graphs are widely used to model real-world objects and their relationships, and large graph data sets are common in many application domains. To understand the underlying characteristics of large graphs, graph summarization techniques are critical. Existing graph summarization methods are mostly statistical (studying statistics such as degree distributions, hop-plots, and clustering coefficients). These statistical methods are very useful, but the resolutions of the summaries are hard to control. In this chapter, we introduce database-style operations to summarize graphs. Like the OLAP-style aggregation methods that allow users to interactively drill-down or roll-up to control the resolution of summarization, the methods described in this chapter provide an analogous functionality for large graph data sets.
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
M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Proceedings of the Data Compression Conference (DCC’01), page 203, IEEE Computer Society, Washington, DC, USA, 2001.
D. A. Bader and K. Madduri. GTgraph: A suite of synthetic graph generators. http://www.cc.gatech.edu/∼kamesh/GTgraph.
G. Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs, NJ 1999.
K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivity server: Fast access to linkage information on the Web. Computer Networks and ISDN Systems, 30(1–7):469–477, 1998.
D. K. Blandford, G. E. Blelloch, and I. A. Kash. Compact representations of separable graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’03), pages 679–688, Baltimore, Maryland, USA, 2003.
P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In Proceedings of the International World Wide Web Conference (WWW’04), pages 595–602, New York, NY, USA, 2004.
P. Boldi and S. Vigna. The WebGraph framework II: Codes for the World-Wide Web. In Proceedings of the Data Compression Conference (DCC’04), page 528, Snowbird, Utah, USA, 2004.
S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the International World Wide Web Conference (WWW’98), pages 107–117, Amsterdam, The Netherlands, 1998.
D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In Proceedings of the SIAM International Conference on Data Mining (SDM’04), Lake Buena Vista, Florida, USA, 2004.
H. Galperin and A. Wigderson. Succinct representations of graphs. Information and Control, 56(3):183–198, 1983.
J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In Proceedings of the IEEE International Conference on Data Engineering (ICDE’96), pages 152–159, New Orleans, Louisiana, USA, 1996.
X. He, M.-Y. Kao, and H.-I. Lu. A fast general methodology for information - theoretically optimal encodings of graphs. In Proceedings of the European Symposium on Algorithms (ESA’99), pages 540–549, London, UK, 1999.
I. Herman, G. Melançon, and M. S. Marshall. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1):24–43, 2000.
M. L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In Proceedings of the International Symposium on Graph Drawing (GD’98), pages 374–383, London, UK, 1998.
K. Keeler and J. Westbrook. Short encodings of planar graphs and maps. Discrete Applied Mathematics, 58(3):239–252, 1995.
R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. In Proceedings of the International World Wide Web Conference (WWW’99), pages 1481–1493, Toronto, Canada, 1999.
M. Ley. DBLP Bibliography. http://www.informatik.uni-trier.de/∼ley/db/.
H.-I. Lu. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’02), pages 223–224, San Francisco, California, USA, 2002.
S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’08), pages 419–432, Vancouver, Canada, 2008.
M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167–256, 2003.
S. Raghavan and H. Garcia-Molina. Representing Web graphs. In Proceedings of the IEEE International Conference on Data Engineering (ICDE’03), pages 405–416, Bangalore, India, 2003.
K. H. Randall, R. Stata, R. G. Wickremesinghe, and J. L. Wiener. The link database: Fast access to graphs of the Web. In Proceedings of the Data Compression Conference (DCC’02), pages 122–131, Washington, DC, USA, 2002.
D. G. Ravi, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In Proceedings of the International Conference on Very Large Data Bases (VLDB’05), pages 721–732, Trondheim, Norway, 2005.
J. S. Risch, D. B. Rex, S. T. Dowson, T. B. Walters, R. A. May, and B. D. Moon. The STARLIGHT information visualization system. In Proceedings of the IEEE Conference on Information Visualisation (IV’97), San Francisco, CA, USA, page 42, 1997.
J. Rissanen. Modeling by shortest data description. Automatica, 14:465–471, 1978.
J. F. Rodrigues, A. J. M. Traina, C. Faloutsos, and C. Traina. SuperGraph visualization. In Proceedings of the IEEE International Symposium on Multimedia (ISM’06), Washington, DC, USA, 2006.
T. Suel and J. Yuan. Compressing the graph structure of the Web. In Proceedings of the Data Compression Conference (DCC’01), pages 213–222, Washington, DC, USA, 2001.
Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’08), pages 567–580, Vancouver, Canada, 2008.
G. J. Wills. NicheWorks — interactive visualization of very large graphs. Journal of Computational and Graphical Statistics, 8(2):190–212, 1999.
N. Zhang, Y. Tian, and J. M. Patel. Discovery-driven graph summarization. In Proceedings of the IEEE International Conference on Data Engineering (ICDE’10), Long Beach, California, USA, 2010.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Tian, Y., Patel, J.M. (2010). Interactive Graph Summarization. In: Yu, P., Han, J., Faloutsos, C. (eds) Link Mining: Models, Algorithms, and Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-6515-8_15
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6515-8_15
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-6514-1
Online ISBN: 978-1-4419-6515-8
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)