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/0806", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information Systems", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Middle East Technical University", 
          "id": "https://www.grid.ac/institutes/grid.6935.9", 
          "name": [
            "Software Research and Development Center Scientific and Technical Research Council of T\u00fcrkiye Dept. of Computer Engineering, Middle East Technical University, 06531\u00a0Ankara, T\u00fcrkiye"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Koc", 
        "givenName": "Kadir", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Middle East Technical University", 
          "id": "https://www.grid.ac/institutes/grid.6935.9", 
          "name": [
            "Software Research and Development Center Scientific and Technical Research Council of T\u00fcrkiye Dept. of Computer Engineering, Middle East Technical University, 06531\u00a0Ankara, T\u00fcrkiye"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dogac", 
        "givenName": "Asuman", 
        "id": "sg:person.01074167140.73", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01074167140.73"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Middle East Technical University", 
          "id": "https://www.grid.ac/institutes/grid.6935.9", 
          "name": [
            "Software Research and Development Center Scientific and Technical Research Council of T\u00fcrkiye Dept. of Computer Engineering, Middle East Technical University, 06531\u00a0Ankara, T\u00fcrkiye"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Evrendilek", 
        "givenName": "Cem", 
        "id": "sg:person.013633220171.70", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013633220171.70"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-1-4471-1486-4_16", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010296669", 
          "https://doi.org/10.1007/978-1-4471-1486-4_16"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/190.194", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010414189"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1995", 
    "datePublishedReg": "1995-01-01", 
    "description": "In this paper, we present a new clustering algorithm called the High Fan Out algorithm and then give the performance comparison of the High Fan Out (HFO) algorithm, Kemighan-Lin based algorithms, and the Probability Ranking Partitioning algorithm for a persistent C++(C**) implementation in a single user environment where the global request stream follows a pattern most of the time. The global request stream is obtained through OO7 Benchmark. It is shown than HFO algorithm performs the best when object sizes are uniform and the cache sizes are relatively large. We conclude with a table that indicates the best clustering algorithm to be used depending on the characteristics of the database application at hand and the restrictions imposed by the computer system. It is also indicated that, the performance of a clustering algorithm can not be based solely on the communication cost, or on the amount of internal fragmentation. On the contrary both of the measures should be taken into account to predict the number of cache misses.", 
    "editor": [
      {
        "familyName": "Eder", 
        "givenName": "Johann", 
        "type": "Person"
      }, 
      {
        "familyName": "Kalinichenko", 
        "givenName": "Leonid A.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-1-4471-3577-7_6", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-19946-5", 
        "978-1-4471-3577-7"
      ], 
      "name": "East/West Database Workshop", 
      "type": "Book"
    }, 
    "name": "Comparison of Clustering Algorithms in a Single User Environment through OO7 Benchmark", 
    "pagination": "77-89", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-4471-3577-7_6"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "0b130a07538171c72f87002e8a56365f2e9feffba45ed7c1a500ecdb39fd054f"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1002325866"
        ]
      }
    ], 
    "publisher": {
      "location": "London", 
      "name": "Springer London", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-4471-3577-7_6", 
      "https://app.dimensions.ai/details/publication/pub.1002325866"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T16:14", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8675_00000244.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-1-4471-3577-7_6"
  }
]

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.

90 TRIPLES      23 PREDICATES      29 URIs      20 LITERALS      8 BLANK NODES