Skip to main content

Scalable Social Graph Analytics Using the Vertica Analytic Platform

  • Conference paper
Enabling Real-Time Business Intelligence (BIRTE 2011)

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 126))

  • 754 Accesses

Abstract

Social Graph Analytics has become very popular these days, with companies like Zynga, Linkedin, and Facebook seeking to derive the most value from their respective social networks. It is common belief that relational databases are ill-equipped to deal with graph problems, resulting in the use of MapReduce implementations or special purpose graph analysis engines. We challenge this belief by presenting a few use-cases that Vertica has very successfully solved with simple SQL over a high-performance relational database engine.

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. Farmville by Zynga, http://www.farmville.com

  2. A/B Testing, http://en.wikipedia.org/wiki/A/Btesting

  3. Newman, M.E.J., Watts, D.J., Strogatz, S.H.: Random graph models of social networks. Proceedings of the National Academy of Sciences of the United States of America 99(suppl. 1), 2566–2572 (2002)

    Article  MATH  Google Scholar 

  4. Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nature Physics 6(11), 888–893 (2010)

    Article  Google Scholar 

  5. Batagelj, V., Zaversnik, M.: An O(m) Algorithm for Cores Decomposition of Networks. CoRR, vol. cs.DS/0310049 (2003)

    Google Scholar 

  6. Epidemic Model, http://en.wikipedia.org/wiki/Epidemicmodel#TheSIRSModel

  7. PEGASUS - A Petabyte Graph Mining System, http://www.cs.cmu.edu/~ctsourak/pegasusICDM09.pdf

  8. Yahoo! Research - Counting Triangles and the Curse of the Last Reducer, http://theory.stanford.edu/%7Esergei/papers/www11-triangles.pdf

  9. MapReduce: Simplified Data Processing on Large Clusters, http://labs.google.com/papers/mapreduce-osdi04.pdf

  10. Fast Counting of Triangles in Large Real Networks: Algorithms and Laws, http://www.cs.cmu.edu/~ctsourak/tsourICDM08.pdf

  11. DOULION: Counting Triangles in Massive Graphs with a Coin, http://www.cs.cmu.edu/~ukang/papers/kdd09.pdf

  12. Counting Triangles and the Curse of the Last Reducer, http://theory.stanford.edu/%7Esergei/papers/www11-triangles.pdf

  13. https://github.com/vertica/Graph-Analytics----Triangle-Counting

  14. http://snap.stanford.edu/data/soc-LiveJournal1.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lawande, S., Shrinivas, L., Venkatesh, R., Walkauskas, S. (2012). Scalable Social Graph Analytics Using the Vertica Analytic Platform. In: Castellanos, M., Dayal, U., Lehner, W. (eds) Enabling Real-Time Business Intelligence. BIRTE 2011. Lecture Notes in Business Information Processing, vol 126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33500-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33500-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33499-3

  • Online ISBN: 978-3-642-33500-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics