S3G2: A Scalable Structure-Correlated Social Graph Generator

  • Minh-Duc Pham
  • Peter Boncz
  • Orri Erling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7755)


Benchmarking graph-oriented database workloads and graph-oriented database systems is increasingly becoming relevant in analytical Big Data tasks, such as social network analysis. In graph data, structure is not mainly found inside the nodes, but especially in the way nodes happen to be connected, i.e. structural correlations. Because such structural correlations determine join fan-outs experienced by graph analysis algorithms and graph query executors, they are an essential, yet typically neglected, ingredient of synthetic graph generators. To address this, we present S3G2: a Scalable Structure-correlated Social Graph Generator. This graph generator creates a synthetic social graph, containing non-uniform value distributions and structural correlations, which is intended as test data for scalable graph analysis algorithms and graph database systems. We generalize the problem by decomposing correlated graph generation in multiple passes that each focus on one so-called correlation dimension; each of which can be mapped to a MapReduce task. We show that S3G2 can generate social graphs that (i) share well-known graph connectivity characteristics typically found in real social graphs (ii) contain certain plausible structural correlations that influence the performance of graph analysis algorithms and queries, and (iii) can be quickly generated at huge sizes on common cluster hardware.


Correlation Dimension Ranking Function Online Social Network Average Path Length Social Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahn, Y., Han, S., Kwak, H., Moon, S., Jeong, H.: Analysis of topological characteristics of huge online social networking services. In: Proc. WWW (2007)Google Scholar
  2. 2.
    Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: A nucleus for a web of open data. Semantic Web Journal, 722–735 (2007)Google Scholar
  3. 3.
    Barabási, A., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Physica A: Statistical Mechanics and its Applications 281(1-4), 69–77 (2000)CrossRefGoogle Scholar
  4. 4.
    Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E 71(3), 036113 (2005)CrossRefGoogle Scholar
  5. 5.
    Benevenuto, F., Rodrigues, T., Cha, M., Almeida, V.: Characterizing user behavior in online social networks. In: Proc. SIGCOMM (2009)Google Scholar
  6. 6.
    Bonato, A., Janssen, J., Prałat, P.: A geometric model for on-line social networks. In: Proc. Conf. on Online Social Networks (2010)Google Scholar
  7. 7.
    de Sola Pool, I., Kochen, M.: Contacts and influence. Elsevier (1978)Google Scholar
  8. 8.
    Foudalis, I., Jain, K., Papadimitriou, C., Sideri, M.: Modeling social networks through user background and behavior. Algorithms and Models for the Web Graph, 85–102 (2011)Google Scholar
  9. 9.
    Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or a news media? In: Proc. WWW (2010)Google Scholar
  10. 10.
    Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C.: Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 133–145. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Milgram, S.: The small world problem. Psychology Today 2(1), 60–67 (1967)MathSciNetGoogle Scholar
  12. 12.
    Mislove, A., Marcon, M., Gummadi, K., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proc. SIGCOMM (2007)Google Scholar
  13. 13.
    Stillger, M., Lohman, G., Markl, V., Kandil, M.: Leo-db2’s learning optimizer. In: Proc. VLDB (2001)Google Scholar
  14. 14.
    Watts, D., Strogatz, S.: Collective dynamics of “small-world” networks. Nature 393(6684), 440–442 (1998)CrossRefGoogle Scholar
  15. 15.
    Wilson, C., Boe, B., Sala, A., Puttaswamy, K., Zhao, B.: User interactions in social networks and their implications. In: Proc. European Conference on Computer Systems (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Minh-Duc Pham
    • 1
  • Peter Boncz
    • 1
  • Orri Erling
    • 2
  1. 1.CWIThe Netherlands
  2. 2.OpenLink SoftwareU.K.

Personalised recommendations