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"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM, USA", 
          "id": "http://www.grid.ac/institutes/grid.266832.b", 
          "name": [
            "Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Helman", 
        "givenName": "Paul", 
        "id": "sg:person.01034346234.77", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01034346234.77"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf00244512", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010947330", 
          "https://doi.org/10.1007/bf00244512"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1989-03", 
    "datePublishedReg": "1989-03-01", 
    "description": "We consider a family of general aggregation problems and prove each of its members to be NP-complete in the strong sense. These problems require that we partition a set of objects into \u201caggregates\u201d. The goal is to minimize the expected cost of satisfying an anticipated collection of requests for subsets of the objects, where the cost of satisfying a request includes both the number and the sizes of the aggregates which must be retrieved. The aggregation problems are viewed as very basic versions of important database optimization problems, including: the partitioning of data items into record types, the clustering of records into physical blocks of storage, and the partitioning of a database into granules to support locking. The NP-completeness results demonstrate that such optimization problems are intractable, even when simplified to the extreme. The fact that the problems are NP-complete in the strong sense also rules out pseudopolynomial time solutions, unless P = NP.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf00289148", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1133515", 
        "issn": [
          "0001-5903", 
          "1432-0525"
        ], 
        "name": "Acta Informatica", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "5", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "26"
      }
    ], 
    "keywords": [
      "data aggregation problem", 
      "collection of requests", 
      "aggregation problem", 
      "optimization problem", 
      "set of objects", 
      "such optimization problems", 
      "NP-completeness results", 
      "data items", 
      "record types", 
      "clustering of records", 
      "physical blocks", 
      "basic version", 
      "time solution", 
      "requests", 
      "NPs", 
      "objects", 
      "strong sense", 
      "partitioning", 
      "clustering", 
      "cost", 
      "database", 
      "set", 
      "collection", 
      "version", 
      "goal", 
      "storage", 
      "solution", 
      "block", 
      "sense", 
      "items", 
      "subset", 
      "number", 
      "locking", 
      "records", 
      "results", 
      "fact", 
      "family", 
      "types", 
      "size", 
      "aggregates", 
      "members", 
      "granules", 
      "extremes", 
      "problem"
    ], 
    "name": "A family of NP-complete data aggregation problems", 
    "pagination": "485-499", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1025237166"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf00289148"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf00289148", 
      "https://app.dimensions.ai/details/publication/pub.1025237166"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:18", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_185.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf00289148"
  }
]

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.

114 TRIPLES      22 PREDICATES      73 URIs      62 LITERALS      6 BLANK NODES