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

The LDBC Social Network Benchmark: Interactive Workload

Published:27 May 2015Publication History

ABSTRACT

The Linked Data Benchmark Council (LDBC) is now two years underway and has gathered strong industrial participation for its mission to establish benchmarks, and benchmarking practices for evaluating graph data management systems. The LDBC introduced a new choke-point driven methodology for developing benchmark workloads, which combines user input with input from expert systems architects, which we outline. This paper describes the LDBC Social Network Benchmark (SNB), and presents database benchmarking innovation in terms of graph query functionality tested, correlated graph generation techniques, as well as a scalable benchmark driver on a workload with complex graph dependencies. SNB has three query workloads under development: Interactive, Business Intelligence, and Graph Algorithms. We describe the SNB Interactive Workload in detail and illustrate the workload with some early results, as well as the goals for the two other workloads.

References

  1. T. G. Armstrong, V. Ponnekanti, D. Borthakur, and M. Callaghan. LinkBench: A Database Benchmark Based on the Facebook Social Graph. SIGMOD '13, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Barahmand and S. Ghandeharizadeh. Bg: A benchmark to evaluate interactive social networking actions. In CIDR, 2013.Google ScholarGoogle Scholar
  3. P. A. Boncz, T. Neumann, and O. Erling. TPC-H analyzed: Hidden messages and lessons learned from an influential benchmark. In TPCTC, pages 61--76, 2013.Google ScholarGoogle Scholar
  4. A. Clauset, C. R. Shalizi, and M. E. Newman. Power-law distributions in empirical data. SIAM review, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Gubichev. Benchmarking transactions. http://ldbc.eu/sites/default/files/LDBC_D2.2.3_final.pdf.Google ScholarGoogle Scholar
  6. A. Gubichev and P. Boncz. Parameter curation for benchmark queries. TPCTC'14.Google ScholarGoogle Scholar
  7. J. Leskovec et al. Meme-tracking and the dynamics of the news cycle. In SIGKDD, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. McPherson et al. Birds of a feather: Homophily in social networks. Annual review of sociology, 2001.Google ScholarGoogle Scholar
  9. G. Moerkotte. Building Query Compilers. http://pi3.informatik.uni-mannheim.de/ moer/querycompiler.pdf.Google ScholarGoogle Scholar
  10. M.-D. Pham, P. Boncz, and O. Erling. S3G2: a Scalable Structure-correlated Social Graph Generator. In TPCTC, 2012.Google ScholarGoogle Scholar
  11. A. Prat and A. Averbuch. Benchmark design for navigational pattern matching benchmarking. http://ldbcouncil.org/sites/default/files/LDBC_D3.3.34.pdf.Google ScholarGoogle Scholar
  12. A. Prat and A. Averbuch. Benchmark design for navigational pattern matching benchmarking - Benchmark Executions. http://ldbcouncil.org/sites/default/files/LDBC_D3.3.34_appendix.pdf.Google ScholarGoogle Scholar
  13. A. Prat-Pérez and D. Domínguez-Sal. How community-like is the structure of synthetically generated graphs? In GRADES, 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Ugander et al. The anatomy of the facebook social graph. arXiv preprint arXiv:1111.4503, 2011.Google ScholarGoogle Scholar
  15. J. Wiener and N. Bronson. Facebook's top open data problems. https://research.facebook.com/blog/1522692927972019/facebook-s-top-open-data-problems/, 2014.Google ScholarGoogle Scholar

Index Terms

  1. The LDBC Social Network Benchmark: Interactive Workload

    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
      SIGMOD '15: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data
      May 2015
      2110 pages
      ISBN:9781450327589
      DOI:10.1145/2723372

      Copyright © 2015 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: 27 May 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      SIGMOD '15 Paper Acceptance Rate106of415submissions,26%Overall Acceptance Rate785of4,003submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader