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": "Masaryk University Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Masaryk University Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Barnat", 
        "givenName": "Ji\u0159\u00ed", 
        "id": "sg:person.011367557177.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011367557177.46"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Masaryk University Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Masaryk University Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Brim", 
        "givenName": "Lubo\u0161", 
        "id": "sg:person.0645117057.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0645117057.83"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Technische Universit\u00e4t Dortmund, Germany", 
          "id": "http://www.grid.ac/institutes/grid.5675.1", 
          "name": [
            "Technische Universit\u00e4t Dortmund, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Edelkamp", 
        "givenName": "Stefan", 
        "id": "sg:person.011300365431.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011300365431.45"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Technische Universit\u00e4t Dortmund, Germany", 
          "id": "http://www.grid.ac/institutes/grid.5675.1", 
          "name": [
            "Technische Universit\u00e4t Dortmund, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sulewski", 
        "givenName": "Damian", 
        "id": "sg:person.07751627652.24", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07751627652.24"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Masaryk University Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Masaryk University Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "\u0160ime\u010dek", 
        "givenName": "Pavel", 
        "id": "sg:person.016270033701.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016270033701.83"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2009", 
    "datePublishedReg": "2009-01-01", 
    "description": "As flash media become common and their capacities and speed grow, they are becoming a practical alternative for standard mechanical drives. So far, external memory model checking algorithms have been optimized for mechanical hard disks corresponding to the model of Aggarwal and Vitter\u00a0[1]. Since flash memories are essentially different, the model of Aggarwal and Vitter no longer describes their typical behavior. On such a different device, algorithms can have different complexity, which may lead to the design of completely new flash-memory-efficient algorithms. We provide a model for computation of I/O complexity on the model of Aggarwal and Vitter modified for flash memories. We discuss verification algorithms optimized for this model and compare the performance of these algorithms with approaches known from I/O efficient model checking on mechanical hard disks. We also give an answer, when the usage of flash devices pays off and whether their further evolution in speed and capacity could broaden a range, where new algorithms outperform the old ones.", 
    "editor": [
      {
        "familyName": "Cofer", 
        "givenName": "Darren", 
        "type": "Person"
      }, 
      {
        "familyName": "Fantechi", 
        "givenName": "Alessandro", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-03240-0_14", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-03239-4", 
        "978-3-642-03240-0"
      ], 
      "name": "Formal Methods for Industrial Critical Systems", 
      "type": "Book"
    }, 
    "keywords": [
      "model of Aggarwal", 
      "mechanical hard disks", 
      "hard disk", 
      "external memory model", 
      "flash memory", 
      "verification algorithm", 
      "efficient algorithm", 
      "Vitter", 
      "memory model", 
      "new algorithm", 
      "algorithm", 
      "flash media", 
      "different devices", 
      "efficient model", 
      "flash devices", 
      "different complexity", 
      "Aggarwal", 
      "complexity", 
      "computation", 
      "memory", 
      "devices", 
      "speed", 
      "model", 
      "usage", 
      "practical alternative", 
      "further evolution", 
      "performance", 
      "typical behavior", 
      "design", 
      "help", 
      "mechanical drive", 
      "answers", 
      "older ones", 
      "drive", 
      "one", 
      "alternative", 
      "disk", 
      "capacity", 
      "behavior", 
      "evolution", 
      "medium", 
      "range", 
      "approach"
    ], 
    "name": "Can Flash Memory Help in Model Checking?", 
    "pagination": "150-165", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1046717426"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-03240-0_14"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-03240-0_14", 
      "https://app.dimensions.ai/details/publication/pub.1046717426"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:49", 
    "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/chapter/chapter_82.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-03240-0_14"
  }
]

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.

139 TRIPLES      23 PREDICATES      69 URIs      62 LITERALS      7 BLANK NODES