JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "BDBC, Beihang University, Beijing, China", 
          "id": "http://www.grid.ac/institutes/grid.64939.31", 
          "name": [
            "University of Edinburgh, Edinburgh, UK", 
            "Shenzhen Institute of Computing Sciences, Shenzhen, China", 
            "BDBC, Beihang University, Beijing, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fan", 
        "givenName": "Wenfei", 
        "id": "sg:person.010530666126.66", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010530666126.66"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Edinburgh, Edinburgh, UK", 
          "id": "http://www.grid.ac/institutes/grid.4305.2", 
          "name": [
            "University of Edinburgh, Edinburgh, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Xu", 
        "givenName": "Ruiqi", 
        "id": "sg:person.07410304642.12", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07410304642.12"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Shanghai Jiao Tong University, Shanghai, China", 
          "id": "http://www.grid.ac/institutes/grid.16821.3c", 
          "name": [
            "Shanghai Jiao Tong University, Shanghai, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Yin", 
        "givenName": "Qiang", 
        "id": "sg:person.014514553742.59", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014514553742.59"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Alibaba Group, Hangzhou, China", 
          "id": "http://www.grid.ac/institutes/grid.481558.5", 
          "name": [
            "Alibaba Group, Hangzhou, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Yu", 
        "givenName": "Wenyuan", 
        "id": "sg:person.014051321123.34", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014051321123.34"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Alibaba Group, Hangzhou, China", 
          "id": "http://www.grid.ac/institutes/grid.481558.5", 
          "name": [
            "Alibaba Group, Hangzhou, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Zhou", 
        "givenName": "Jingren", 
        "id": "sg:person.016056427127.67", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016056427127.67"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-1-84800-998-1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047271474", 
          "https://doi.org/10.1007/978-1-84800-998-1"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-0-387-09766-4_500", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042857469", 
          "https://doi.org/10.1007/978-0-387-09766-4_500"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00224-006-1350-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001099122", 
          "https://doi.org/10.1007/s00224-006-1350-7"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-319-49487-6_4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007230701", 
          "https://doi.org/10.1007/978-3-319-49487-6_4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1038/30918", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041985305", 
          "https://doi.org/10.1038/30918"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2022-04-11", 
    "datePublishedReg": "2022-04-11", 
    "description": "Graph partitioning is crucial to parallel computations on large graphs. The choice of partitioning strategies has strong impact on the performance of graph algorithms. For an algorithm of our interest, what partitioning strategy fits it the best and improves its parallel execution? Is it possible to provide a uniform partition to a batch of algorithms that run on the same graph simultaneously, and speed up each and every of them? This paper aims to answer these questions. We propose an application-driven hybrid partitioning strategy that, given a graph algorithm A\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$${{\\mathcal {A}}}$$\\end{document}, learns a cost model for A\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$${{\\mathcal {A}}}$$\\end{document} as polynomial regression. We develop partitioners that, given the learned cost model, refine an edge-cut or vertex-cut partition to a hybrid partition and reduce the parallel cost of A\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$${{\\mathcal {A}}}$$\\end{document}. Moreover, we extend the cost-driven strategy to support multiple algorithms at the same time and reduce the parallel cost of each of them. Using real-life and synthetic graphs, we experimentally verify that our partitioning strategy improves the performance of a variety of graph algorithms, up to 22.5\u00d7\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$22.5\\times $$\\end{document}.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s00778-022-00736-2", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isFundedItemOf": [
      {
        "id": "sg:grant.4273689", 
        "type": "MonetaryGrant"
      }
    ], 
    "isPartOf": [
      {
        "id": "sg:journal.1044889", 
        "issn": [
          "1066-8888", 
          "0949-877X"
        ], 
        "name": "The VLDB Journal", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }
    ], 
    "keywords": [
      "graph algorithms", 
      "parallel cost", 
      "graph partitioning", 
      "cost model", 
      "hybrid partitioning strategy", 
      "parallel execution", 
      "large graphs", 
      "synthetic graphs", 
      "multiple algorithms", 
      "hybrid partition", 
      "partitioning strategies", 
      "algorithm", 
      "graph", 
      "same graph", 
      "partition", 
      "polynomial regression", 
      "partitioner", 
      "execution", 
      "same time", 
      "uniform partition", 
      "partitioning", 
      "performance", 
      "computation", 
      "cost", 
      "model", 
      "strategies", 
      "interest", 
      "variety", 
      "time", 
      "strong impact", 
      "batch", 
      "choice", 
      "regression", 
      "questions", 
      "impact", 
      "paper"
    ], 
    "name": "Application-driven graph partitioning", 
    "pagination": "1-24", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1147023077"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00778-022-00736-2"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00778-022-00736-2", 
      "https://app.dimensions.ai/details/publication/pub.1147023077"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-06-01T22:25", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/article/article_928.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s00778-022-00736-2"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

149 TRIPLES      22 PREDICATES      64 URIs      51 LITERALS      4 BLANK NODES