Skip to main content

S3G2: A Scalable Structure-Correlated Social Graph Generator

  • Conference paper
Selected Topics in Performance Evaluation and Benchmarking (TPCTC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7755))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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)

    Article  Google Scholar 

  4. Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E 71(3), 036113 (2005)

    Article  Google Scholar 

  5. Benevenuto, F., Rodrigues, T., Cha, M., Almeida, V.: Characterizing user behavior in online social networks. In: Proc. SIGCOMM (2009)

    Google Scholar 

  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. de Sola Pool, I., Kochen, M.: Contacts and influence. Elsevier (1978)

    Google Scholar 

  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. 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. 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)

    Chapter  Google Scholar 

  11. Milgram, S.: The small world problem. Psychology Today 2(1), 60–67 (1967)

    MathSciNet  Google Scholar 

  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. Stillger, M., Lohman, G., Markl, V., Kandil, M.: Leo-db2’s learning optimizer. In: Proc. VLDB (2001)

    Google Scholar 

  14. Watts, D., Strogatz, S.: Collective dynamics of “small-world” networks. Nature 393(6684), 440–442 (1998)

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pham, MD., Boncz, P., Erling, O. (2013). S3G2: A Scalable Structure-Correlated Social Graph Generator. In: Nambiar, R., Poess, M. (eds) Selected Topics in Performance Evaluation and Benchmarking. TPCTC 2012. Lecture Notes in Computer Science, vol 7755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36727-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36727-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36726-7

  • Online ISBN: 978-3-642-36727-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics