skip to main content
10.1145/2484425.2484430acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Early experiences in using a domain-specific language for large-scale graph analysis

Published:23 June 2013Publication History

ABSTRACT

Large-scale graph analysis has recently been drawing lots of attention from both industry and academia. Although there are already several frameworks designed for scalable graph analysis, e.g. Giraph [1], all these frameworks adopt non-traditional programming models and APIs. This can significantly lower the productivity of the framework user. This paper discusses the feasibility of using an intuitive Domain-Specific Language (DSL) for graph analysis. Specifically, we use a compiler to translate Green-Marl [5] programs into an equivalent Giraph application, automatically bridging between very different programming models. We observe that the DSL programs are concise and intuitive, and that the compiler generated Giraph implementations exhibit performance on par with that of hand-written ones. However, the DSL compilation cannot but fail if the algorithm is fundamentally not compatible with the target framework. Overall, we believe that the DSL-based approach will provide great productivity benefits once it matures.

References

  1. Apache Giraph Project. http://giraph.apache.org.Google ScholarGoogle Scholar
  2. Green-Marl DSL. http://github.com/stanford-ppl/Green-Marl.Google ScholarGoogle Scholar
  3. Stanford network analysis library. http://snap.stanford.edu/snap.Google ScholarGoogle Scholar
  4. Apache Hadoop. http://hadoop.apache.org/.Google ScholarGoogle Scholar
  5. S. Hong, H. Chafi, E. Sedlar, and K. Olukotun. Green-Marl: A DSL for Easy and Ffficient Graph Analysis. In ASPLOS, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Hong, S. Salihoglu, J. Widom, and K. Olukotun. Tech Report: Compiling Green-Marl into GPS. http://ppl.stanford.edu/papers/tr_gm_gps.pdf.Google ScholarGoogle Scholar
  7. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? WWW '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. Hellerstein. Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud. Proceedings of the VLDB Endowment, 5(8):716--727, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: A System for Large-scale Graph Processing. In SIGMOD '10. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. Olston, B. Reed, U. Srivastava, R. Kumar, and A. Tomkins. Pig Latin: A Not-so-foreign Language for Data Processing. In SIGMOD. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. L. Page. Method for node ranking in a linked database, Sept. 4 2001. US Patent 6,285,999.Google ScholarGoogle Scholar
  13. S. Salihoglu and J. Widom. GPS: Graph Processing System. http://infolab.stanford.edu/gps.Google ScholarGoogle Scholar
  14. S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In WWW. ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Thusoo, J. Sarma, N. Jain, Z. Shao, P. Chakka, S. Anthony, H. Liu, P. Wyckoff, and R. Murthy. Hive: A Warehousing Solution Over a Map-Reduce Framework. Proceedings of the VLDB Endowment, 2(2):1626--1629, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Trinity. http://research.microsoft.com/en-us/projects/trinity/default.aspx.Google ScholarGoogle Scholar
  17. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103--111, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    GRADES '13: First International Workshop on Graph Data Management Experiences and Systems
    June 2013
    101 pages
    ISBN:9781450321884
    DOI:10.1145/2484425

    Copyright © 2013 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 23 June 2013

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    Overall Acceptance Rate29of61submissions,48%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader